基于软约束逻辑编程的单播和组播QoS路由
Unicast and Multicast Qos Routing with Soft Constraint Logic Programming
摘要：
我们提出了一个正式的模型来表示和解决单播/组播路由问题的网络与服务质量（QoS）的要求。为了实现这一点，首先我们将网络转换为加权图（单播）或与或图（组播），其中连接器上的权重对应于在相关网络链路上发送数据包的多维成本：权重向量的每个分量表示不同的QoS度量值（例如带宽，成本，延迟，丢包）。第二步是将此图作为软约束逻辑编程（SCLP）中的程序编写：该框架的引擎然后能够通过优化其成本并解决施加在其上的约束（例如延迟<40毫秒）来找到最佳路径/树，从而找到QoS路由问题的解决方案。此外，c-半环结构是一个方便的工具来建模QoS度量。最后，我们提供了一个实现的框架在无标度网络，我们建议如何提高性能。
英文摘要：
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 the framework over scale-free networks and we suggest how the performance can be improved.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
