PUMA
Istituto di Informatica e Telematica     
Bistarelli S., Montanari U., Rossi F., Santini F. Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming. In: Electronic Notes in Theoretical Computer Science, vol. 190/3 pp. 111 - 127. Elsevier Science Publishers, 2007.
 
 
Abstract
(English)
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we draw the network adapting it to a weighted AND-OR graph, where the weight on a connector corresponds to the cost of sending a packet on the network link modelled by that connector. Then, we use the Soft Constraint Logic Programming (SCLP) framework as a convenient declarative programming environment where to specify related problems. In particular, we show how the semantic of a SCLP program computes the best tree in the corresponding AND-OR graph: this result can be adopted to find, from a given source node, the multicast distribution tree having minimum cost and reaching all the destination nodes of the multicast communication. The costs on the connectors can be described also as vectors (multidimensional costs), each component representing a different Quality of Service metric value. Therefore, the construction of the best tree may involve a set of criteria to be all optimized (multi-criteria problem), e.g. maximum global bandwidth and minimum delay that can be experienced on a single link.
Subject And-or Graphs
Quality of Service
Multicast
Semiring
G.2.2 Graph Theory


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional