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...

Celý popis

Podrobná bibliografia

Vydané v:	Electronic notes in theoretical computer science Ročník 190; číslo 3; s. 111 - 127
Hlavní autori:	Bistarelli, Stefano, Montanari, Ugo, Rossi, Francesca, Santini, Francesco
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 06.09.2007
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!