By Topic

Distributed Ant Algorithm for Inter-Carrier Service Composition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Helia Pouyllau ; Centre de Villarceaux, Alcatel-Lucent Bell Labs. France, Nozay, France ; Nabil Bachir Djarallah

The future Internet would benefit from the delivery of high performance services crossing several carriers and bringing new incomes to telco operators. Such services compel carriers to guarantee quality of service (QoS) inside their boundaries. As carriers are independently administrated, architectures and processes must be reconsidered so that requirements for autonomy and confidentiality are respected. In this context, enforcing Service Level Agreements (SLAs) between partners cannot be avoided. The following problem has to be solved: given an end-to- end service request and collections of SLAs on each participating carrier, establish an end-to-end contract, which gives an optimal service under reliable QoS guarantees. In previous works, we described distributed processes based on dynamic programming principles. In this article, we depict a distributed adaptation of a meta-heuristic algorithm, known as ant colony algorithm. We demonstrate that the performances of this algorithm are competitive to other works.

Published in:

Next Generation Internet Networks, 2009. NGI '09

Date of Conference:

1-3 July 2009