Dynamic Routing and Wavelength Assignment in WDM Networks with Ant-Based Agents

Ngo, Son Hong; Jiang, Xiaohong; Horiguchi, Susumu; Guo, Minyi

doi:10.1007/978-3-540-30121-9_79

Cited by 16 publications

(19 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The dynamic RWA is even more difficult because of the fact that, the dynamic connection requests arrive randomly and remain in the network for random amounts of time [20].…”

Section: Routing and Wavelength Assignment (Rwa)mentioning

confidence: 99%

Impairment-Aware Dynamic Routing and Wavelength Assignment in Translucent Optical WDM Networks

Varanasi

Bandyopadhyay

Jaekel

2014

Distributed Computing and Networking

View full text Add to dashboard Cite

“…The dynamic RWA is even more difficult because of the fact that, the dynamic connection requests arrive randomly and remain in the network for random amounts of time [20].…”

Section: Routing and Wavelength Assignment (Rwa)mentioning

confidence: 99%

Impairment-Aware Dynamic Routing and Wavelength Assignment in Translucent Optical WDM Networks

Varanasi

Bandyopadhyay

Jaekel

2014

Distributed Computing and Networking

View full text Add to dashboard Cite

“…In the basic ant-based routing algorithm for WDM networks [19], this parameter (amount of trailing pheromone) is computed by the following principle: the amount of trailing pheromone decreases with increasing path length and increases with an increased number of available wavelengths.…”

Section: Routing Table Updatingmentioning

confidence: 99%

“…As explained in [19], ant-based algorithms adopting the First-Highest scheme have a stagnation state problem. When the network state changes, e.g., when a lightpath is established or released, ants may not be able to quickly find a better path for a new request.…”

Section: Selection Of Path and Wavelengthmentioning

confidence: 99%

An Ant-Based Approach for Dynamic RWA in Optical WDM Networks

2006

Self Cite

View full text Add to dashboard Cite

-In this paper, we propose a new ant-based algorithm for the dynamic routing and wavelength assignment (RWA) problem in optical WDM networks under the wavelength continuity constraint.Unlike conventional approaches, which usually require centralized global network information, our new RWA algorithm constructs the routing solution in a distributed manner by means of cooperative ants.To facilitate the ants' foraging task, we adopt in our algorithm a probabilistic routing table structure for route selection. The new algorithm is highly adaptive in that it always keeps a suitable number of ants in the network to cooperatively explore the network states and continuously update the routing tables, so that the route for a connection request can be determined promptly by the current states of routing tables with only a small setup delay. Some new schemes for path scoring and path searching are also proposed to enhance the performance of our ant-based algorithm. Extensive simulation results upon three typical network topologies indicate that the proposed algorithm has a very good adaptability to traffic variations and it outperforms both the fixed routing algorithm and the promising fixed-alternate routing algorithm in terms of blocking probability. The ability to guarantee both a low blocking probability and a small setup delay makes the new ant-based routing algorithm very attractive for both the optical circuit switching networks and future optical burst switching works.

show abstract

“…[1]The Routing and Wavelength Assignment (RWA) problem is how to determine both a route and wavelengths for a connection request. Without wavelength conversion capability, a light path must use the same wavelength on all the links along its route, which is referred to as the wavelength continuity constraint.…”

Section: Introductionmentioning

confidence: 99%