Home // International Journal On Advances in Networks and Services, volume 2, number 1, 2009 // View article

Implementing and Testing a Formal Framework for Constraint-Based Routing over Scale-free Networks

Authors:
Stefano Bistarelli
Francesco Santini

Keywords: Constraint-Based Routing, Quality of Service, Scale-free Networks, Soft Constraint Logic Programming.

Abstract:
We propose a formal model to represent and solve the Constraint-Based Routing problem in networks. To attain this, we model the network adapting it to a weighted or graph (unicast delivery) or and-or graph (multicast delivery), where the weight on a connector corresponds to the cost of sending a packet on the network link modelled by that connector. We use the Soft Constraint Logic Programming (SCLP) framework as a convenient declarative programming environment in which to solve the routing problem. In particular, we show how the semantics of an SCLP program computes the best route in the corresponding graph. The costs on the connectors can be described also as vectors (multidimensional costs), with each component representing a different Quality of Service metric value. At last, we provide an implementation of the framework over scale-free networks with the ECLiPSe programming environment, and we present the obtained results.

Pages: 13 to 24

Copyright: Copyright (c) to authors, 2009. Used with permission.

Publication date: June 7, 2009

Published in: journal

ISSN: 1942-2644