By Topic

Dynamic lightpath protection in WDM optical networks using ant-based mobile agents

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
$31 $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

3 Author(s)
Son Hong Ngo ; Graduate Sch. of Inf. Sci., JAIST, Ishikawa, Japan ; Xiaohong Jiang ; Horiguchi, S.

In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine a protection cycle to establish a dependable lightpath with fault-tolerance requirement. This problem is identified as NP-complete, thus a heuristic for finding near optimal solution with reasonable computation time is usually preferred. Inspired from the principle of ant colony optimization, we develop in this paper an ant-based mobile agents algorithm for this problem with improved blocking performance. To enable the new ant-based algorithm, we propose to use on each network node both a routing table that contains a set of feasible cycles between source destination nodes and also a pheromone table for mobile agents. By keeping a suitable number of mobile agents in a network to continually and proactively update the cycles in a routing table based on the current network congestion state, the routing solution of a connection request can be obtained based on simply a local searching with a reasonable computation time. Extensive simulation results upon the ns-2 network simulator show that our new algorithm can achieve a significantly lower blocking probability than the promising algorithm for dynamic lightpath protection with a comparable computation complexity.

Published in:

Intelligent Agent Technology, IEEE/WIC/ACM International Conference on

Date of Conference:

19-22 Sept. 2005