A Formal and Practical Framework for Constraint-Based Routing (Contributo in atti di convegno)

Type
Label
  • A Formal and Practical Framework for Constraint-Based Routing (Contributo in atti di convegno) (literal)
Anno
  • 2008-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1109/ICN.2008.12 (literal)
Alternative label
  • [1] Bistarelli S., [1] Santini F. (2008)
    A Formal and Practical Framework for Constraint-Based Routing
    in Seventh International Conference on Networking (ICN 2008), Cancun
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • [1] Bistarelli S., [1] Santini F. (literal)
Pagina inizio
  • 162 (literal)
Pagina fine
  • 167 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali
  • 6 (literal)
Note
  • ISI Web of Science (WOS) (literal)
  • Scopu (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • [1] IIT- CNR, Pisa, Italy (literal)
Titolo
  • A Formal and Practical Framework for Constraint-Based Routing (literal)
Abstract
  • We propose a formal model to represent and solve the Constraint-Based Routing problem in networks. To attain this, we model the network adapting it to a weighted or graph (unicast delivery) or and-or graph (multicast delivery), where the weight on a connector corresponds to the cost of sending a packet on the network link modelled by that connector. We use the Soft Constraint Logic Programming (SCLP) framework as a convenient declarative programming environment in which to solve the routing problem. In particular, we show how the semantics of an SCLP program computes the best route in the corresponding graph. At last, we provide an implementation of the framework over scale-free networks. (literal)
Editore
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Editore di
Insieme di parole chiave di
data.CNR.it