Skip to main content
Article thumbnail
Location of Repository

Unicast and multicast QoS routing with soft constraint logic programming

By Stefano Bistarelli, Ugo Montanari, Francesca Rossi and Francesco Santini

Abstract

We present a formal model to represent and solve the unicast/multicast routing problem in networks with Quality of Service (QoS) requirements. To attain this, first we translate the network adapting it to a weighted graph (unicast) or and-or graph (multicast), where the weight on a connector corresponds to the multidimensional cost of sending a packet on the related network link: each component of the weights vector represents a different QoS metric value (e.g. bandwidth, cost, delay, packet loss). The second step consists in writing this graph as a program in Soft Constraint Logic Programming (SCLP): the engine of this framework is then able to find the best paths/trees by optimizing their costs and solving the constraints imposed on them (e.g. delay ≤ 40msec), thus finding a solution to QoS routing problems. Moreover, c-semiring structures are a convenient tool to model QoS metrics. At last, we provide an implementation of th

Topics: Categories and Subject Descriptors, D.3.2 [Programming Languages, Language Classifications—Constraint and logic languages, D.3.3 [Programming Languages, Language Constructs and Features—Constraints, C.2.3 [Computer-Communication Networks, Network Operations—Network management, F.4.1 [Mathematical Logic And Formal Languages, Mathematical Logic—Logic and constraint programming General Terms, Languages, Measurement, Theory
Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.312.5570
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://arxiv.org/pdf/0704.1783... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.