Unicast and Multicast Qos Routing with Soft Constraint Logic Programming

Details Unicast and Multicast Qos Routing with Soft Constraint Logic Programming Unicast and Multicast Qos Routing with Soft Constraint Logic Programming

2007-04-13

arxiv.org/abs/0704.1783v3

Computer Science

Logic in Computer Science

45 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Unicast and Multicast Qos Routing with Soft Constraint Logic Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Unicast and Multicast Qos Routing with Soft Constraint Logic Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unicast and Multicast Qos Routing with Soft Constraint Logic Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-678524