Introduction to algorithms
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
On the complexity of quality of service routing
Information Processing Letters
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Optimizing decision trees through heuristically guided search
Communications of the ACM
Soft constraint propagation and solving in CHRs
Proceedings of the 2002 ACM symposium on Applied computing
Hop-by-hop quality of service routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Soft Constraint Logic Programming and Generalized Shortest Path Problems
Journal of Heuristics
Semiring frameworks and algorithms for shortest-distance problems
Journal of Automata, Languages and Combinatorics
Compiling Semiring-Based Constraints with clp (FD, S)
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
An Original Constraint Based Approach for Solving over Constrained Problems
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
A System for Tabled Constraint Logic Programming
CL '00 Proceedings of the First International Conference on Computational Logic
ICCC '02 Proceedings of the 15th international conference on Computer communication
A unified approach to path problems
A unified approach to path problems
Semirings for Soft Constraint Solving and Programming (LECTURE NOTES IN COMPUTER SCIENCE)
Semirings for Soft Constraint Solving and Programming (LECTURE NOTES IN COMPUTER SCIENCE)
Declarative routing: extensible routing with declarative queries
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
SHReQ: Coordinating Application Level QoS
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Soft concurrent constraint programming
ACM Transactions on Computational Logic (TOCL)
Constraint Logic Programming using Eclipse
Constraint Logic Programming using Eclipse
A Formal and Practical Framework for Constraint-Based Routing
ICN '08 Proceedings of the Seventh International Conference on Networking
Enhancing constraints manipulation in semiring-based formalisms
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Semiring-based constraint logic programming
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Constraint solving over semirings
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Research challenges in QoS routing
Computer Communications
Constraint-based routing in the internet: Basic principles and recent research
IEEE Communications Surveys & Tutorials
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Multicast routing with end-to-end delay and delay variation constraints
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
IEEE Network: The Magazine of Global Internetworking
Multicast routing and its QoS extension: problems, algorithms, and protocols
IEEE Network: The Magazine of Global Internetworking
Performance evaluation of constraint-based path selection algorithms
IEEE Network: The Magazine of Global Internetworking
QoS-aware management of monotonic service orchestrations
Formal Methods in System Design
| Hi-index | 0.00 |
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.