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

Type

• Prodotto della ricerca (Classe)
• Articolo in rivista (Classe)

Label

• Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming (Articolo in rivista) (literal)

Anno

• 2007-01-01T00:00:00+01:00 (literal)

Alternative label

• [1] Bistarelli S., [2] Montanari U., [3] Rossi F., [4] Santini F. (2007)
  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; Elsevier Science Publishers, Amsterdam (Paesi Bassi)
  (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori

• [1] Bistarelli S., [2] Montanari U., [3] Rossi F., [4] Santini F. (literal)

Pagina inizio

• 111 (literal)

Pagina fine

• 127 (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume

• 190/3 (literal)

Rivista

• Electronic notes in theoretical computer science (Rivista)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali

• 17 (literal)

Note

• Scopu (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni

• [1] IIT-CNR, Pisa, Italy; [2] Dipartimento di Informatica, Pisa, Italy; [3] Dipartimento di Matematica Pura ed Applicata, Padova, Italy; [4] IMT, Lucca, Italy (literal)

Titolo

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

Abstract

• 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. (literal)

Editore

• Elsevier Science Publishers (Editore)

Prodotto di

• Istituto di informatica e telematica (IIT) (Istituto)
• Sicurezza dell'informazione (INT.P01.007.001) (Modulo)

Autore CNR

• STEFANO BISTARELLI (Persona)

Insieme di parole chiave

• Keywords of "Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming" (Insieme di parole chiave)

Incoming links:

Prodotto

• Istituto di informatica e telematica (IIT) (Istituto)
• Sicurezza dell'informazione (INT.P01.007.001) (Modulo)

Autore CNR di

• STEFANO BISTARELLI (Persona)

Editore di

• Elsevier Science Publishers (Editore)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi

• Electronic notes in theoretical computer science (Rivista)

Insieme di parole chiave di

• Keywords of "Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming" (Insieme di parole chiave)