Unicast and multicast QoS routing with soft-constraint logic programming

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). 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 ≤ 40 ms), thus finding a solution to QoS routing problems. C-semiring structures are a convenient tool to model QoS metrics. At last, we provide an implementation of the framework over scale-free networks and we suggest how the performance can be improved. The article highlights the expressivity of SCLP.

[1]  S. Havlin,et al.  Scale-free networks are ultrasmall. , 2002, Physical review letters.

[2]  Francesca Rossi,et al.  Constraint Solving over Semirings , 1995, IJCAI.

[3]  Jordi Domingo-Pascual,et al.  Research challenges in QoS routing , 2006, Comput. Commun..

[4]  Robert E. Tarjan,et al.  A Unified Approach to Path Problems , 1981, JACM.

[5]  Krzysztof R. Apt,et al.  Constraint logic programming using Eclipse , 2007 .

[6]  George N. Rouskas,et al.  Multicast Routing with End-to-End Delay and Delay Variation Constraints , 1997, IEEE J. Sel. Areas Commun..

[7]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.

[8]  Fabio Gadducci,et al.  Enhancing Constraints Manipulation in Semiring-Based Formalisms , 2006, ECAI.

[9]  Francesca Rossi,et al.  Semiring-based constraint solving and optimization , 1997 .

[10]  Francesca Rossi,et al.  Semiring-based Constraint Logic Programming , 1997, IJCAI.

[11]  Ossama Younis,et al.  Constraint-based routing in the internet: Basic principles and recent research , 2003, IEEE Communications Surveys & Tutorials.

[12]  Francesca Rossi,et al.  Soft Constraint Logic Programming and Generalized Shortest Path Problems , 2002, J. Heuristics.

[13]  Francesca Rossi,et al.  Soft Concurrent Constraint Programming , 2002, ESOP.

[14]  Peter Steenkiste,et al.  Quality-of-Service Routing for Traffic with Performance Guarantees , 1997 .

[15]  Tom Schrijvers,et al.  Constraint Handling Rules and Tabled Execution , 2004, ICLP.

[16]  Dianne Easterling,et al.  March , 1890, The Hospital.

[17]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[18]  Stefano Bistarelli,et al.  A Formal and Practical Framework for Constraint-Based Routing , 2008, Seventh International Conference on Networking (icn 2008).

[19]  Francesca Rossi,et al.  Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming , 2007, QAPL.

[20]  Emilio Tuosto,et al.  SHReQ: coordinating application level QoS , 2005, Third IEEE International Conference on Software Engineering and Formal Methods (SEFM'05).

[21]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[22]  Stefano Bistarelli.  Semirings for Soft Constraint Solving and Programming , 2004, Lecture Notes in Computer Science.

[23]  Zheng Wang,et al.  On the Complexity of Quality of Service Routing , 1999, Inf. Process. Lett..

[24]  Bin Wang,et al.  Multicast routing and its QoS extension: problems, algorithms, and protocols , 2000 .

[25]  Christian Bessiere,et al.  An Original Constraint Based Approach for Solving over Constrained Problems , 2000, CP.

[26]  Stefano Bistarelli.  Semirings for Soft Constraint Solving and Programming (LECTURE NOTES IN COMPUTER SCIENCE) , 2004 .

[27]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[28]  Thom W. Frühwirth,et al.  Soft constraint propagation and solving in CHRs , 2002, SAC '02.

[29]  I. V. Ramakrishnan,et al.  Efficient Tabling Mechanisms for Logic Programs , 1995, ICLP.

[30]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[31]  Xipeng Xiao,et al.  Internet QoS: a big picture , 1999, IEEE Netw..

[32]  Ion Stoica,et al.  Declarative routing: extensible routing with declarative queries , 2005, SIGCOMM '05.

[33]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[34]  Nic Wilson.  Bounds and Pre-processing for Local Computation of Semiring Valuations 1 , 2004 .

[35]  Alberto Martelli,et al.  Optimizing decision trees through heuristically guided search , 1978, CACM.

[36]  Julian Gutierrez,et al.  Timed Concurrent Constraint Programming in Systems Biology , 2006 .

[37]  Emilio Tuosto,et al.  A Formal Basis for Reasoning on Programmable QoS , 2003, Verification: Theory and Practice.

[38]  Michael B. Smyth.  Power Domains , 1978, J. Comput. Syst. Sci..

[39]  S. V. Raghavan,et al.  Survey of QoS routing , 2002 .

[40]  Mehryar Mohri,et al.  Semiring Frameworks and Algorithms for Shortest-Distance Problems , 2002, J. Autom. Lang. Comb..

[41]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[42]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[43]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..

[44]  Yan Georget,et al.  Compiling Semiring-Based Constraints with clp (FD, S) , 1998, CP.

[45]  Piet Van Mieghem,et al.  Performance evaluation of constraint-based path selection algorithms , 2004, IEEE Network.

[46]  Alessandro Vespignani,et al.  Internet topology at the router and autonomous system level , 2002, ArXiv.

[47]  Eric S. Crawley,et al.  A Framework for QoS-based Routing in the Internet , 1998, RFC.

[48]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[49]  David Scott Warren,et al.  A System for Tabled Constraint Logic Programming , 2000, Computational Logic.

[50]  Piet Van Mieghem,et al.  Hop-by-hop quality of service routing , 2001, Comput. Networks.

[51]  Manuel V. Hermenegildo,et al.  The ciao prolog system , 2002 .

[52]  Piet Van Mieghem,et al.  Trade-Off Curves for QoS Routing , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[53]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[54]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[55]  Francesca Rossi,et al.  Semiring-based constraint satisfaction and optimization , 1997, JACM.

[56]  Zoubir Mammeri,et al.  Towards a formal model for QoS specification and handling in networks , 2004, Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004..