By Topic

N-Best Optimal Path Ant Routing Algorithm for State-Dependent N Best Quality of service Routes in IP Networks

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)
Farid Baguenine ; University Rene Descartes, France ; Abdelhamid Mellouk

As routing mechanism is a key to success of future communication networking, computing constrained shortest paths is fundamental to some important network functions such as QoS routing or traffic engineering. The problem is to And feasible paths satisfying QoS requirements and optimizing resource usage and degrading gracefully during periods of heavy load. This paper introduces a Quality of Service (QoS) routing protocol aimed to offload congested links while optimizing end-to-end delay. The proposed algorithm, called NOPAR "N-best Optimal Paths Ant Routing", extends the earlier N best Optimal path Q Routing Algorithm (NOQRA) by integrating the exploration and reinforcement function inspired by Ant Colony Optimization approaches. NOPAR uses a model combining both a stochastic planned pre-navigation for the exploration phase (forward ant) and a deterministic approach for the backward phase (backward ant). The introduced algorithm is compared with earlier version of NOQRA and the well-known routing algorithms such as SPF or OSPF. The performance analysis under simulation environment using OPNET demonstrates that NOPAR performs better than the classical approach especially over load high networks or link failures conditions.

Published in:

32nd IEEE Conference on Local Computer Networks (LCN 2007)

Date of Conference:

15-18 Oct. 2007