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

Full description

Bibliographic Details

Published in:	Electronic notes in theoretical computer science Vol. 190; no. 3; pp. 111 - 127
Main Authors:	Bistarelli, Stefano, Montanari, Ugo, Rossi, Francesca, Santini, Francesco
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 06.09.2007
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!