Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming

We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model 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 connecto...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Electronic notes in theoretical computer science Jg. 190; H. 3; S. 111 - 127
Hauptverfasser:	Bistarelli, Stefano, Montanari, Ugo, Rossi, Francesca, Santini, Francesco
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 06.09.2007
Schlagworte:	And-or Graphs Multicast Quality of Service Routing Soft Constraint Logic Programming Multicast Routing Soft Constraint Logic Programming And-or Graphs Quality of Service
ISSN:	1571-0661, 1571-0661
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!