An Ant-based Algorithm for Distributed RWA in Optical Burst Switching
Document typeConference lecture
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
To meet the demanded bandwidth requirements of future optical communication networks, more dynamism, scalability and automatism will need to be provided, which will require, as well, new control plane designs to respond to network changes very rapidly. In this work, we propose the use of an ant colony optimization (ACO) algorithm to support the routing and wavelength assignment in wavelength continuity constraint optical burst-switched networks. The main advantage of the protocol is its distributed nature, which provides higher survivability to network failures or traffic congestion. From the results we see that the new protocol responds effectively to congestion while at the same time providing better performance in comparison to the shortest path routing with random wavelength assignment.
CitationTriay, J.; Cervelló, C. An ant-based algorithm for distributed RWA in optical burst switching. A: ICTON. "11th International Conference on Transparent Optical Networks". S. Miguel, Azores: IEEE, 2009, p. 1-4.