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

DOI10.1016/j.entcs.2007.07.008zbMath1279.68021OpenAlexW2101150281MaRDI QIDQ2870287

Francesca Rossi, Stefano Bistarelli, Francesco Santini, Ugo Montanari

Publication date: 17 January 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.07.008

zbMATH Keywords

quality of servicemulticastroutingand-or graphssoft constraint logic programming

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Logic programming (68N17)

Related Items (4)

SCLP for Trust Propagation in Small-World Networks ⋮ C-semiring Frameworks for Minimum Spanning Tree Problems ⋮ Semiring-Based Soft Constraints ⋮ The PITA system: Tabling and answer subsumption for reasoning under uncertainty

Uses Software

• Ciao

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast algorithm for Steiner trees
• Semirings for constraint solving and programming.
• Steiner problem in networks: A survey
• Optimizing decision trees through heuristically guided search
• Semiring-based constraint satisfaction and optimization
• Soft concurrent constraint programming
• Verification: Theory and Practice
• Soft constraint logic programming and generalized shortest path problems

This page was built for publication: Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming