A new approach to improving the grooming performance with dynamic traffic in SONET rings

Authors:
Kun-hong Liu;Yong Xu
Affiliations:
School of Physics and Optoelectronics Technology, Fujian Normal University, Fuzhou, Fujian 350007, PR China;School of Computer Science, The University of Birmingham, Edgbaston, Birmingham, West Midlands, B15 2TT, UK and School of Physics and Optoelectronics Technology, Fujian Normal University, Fuzhou, ...
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2004

Citing 4
Cited 3

An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings

IEEE/ACM Transactions on Networking (TON)
Strictly nonblocking grooming of dynamic traffic in unidirectional SONET/WDM rings using genetic algorithms

Computer Networks: The International Journal of Computer and Telecommunications Networking
Traffic grooming in unidirectional WDM ring networks using genetic algorithms

Computer Communications
Traffic grooming in WDM networks: past and future

IEEE Network: The Magazine of Global Internetworking

Computational intelligence in photonics technology and optical networks: A survey and future perspectives

Information Sciences: an International Journal
Reconfigurable grooming of dynamic traffic in SONET/WDM ring networks

Journal of High Speed Networks
Grooming of Dynamic Traffic in WDM Tree Networks Using Genetic Algorithms

ISNN 2009 Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traffic grooming is widely employed to minimize the number of ADM's in today's WDM rings to reduce the total cost of the network. Since traffic often changes over time, the problem of grooming dynamic traffic becomes more and more important. In this paper, we use the technique of splitting traffic to the grooming of arbitrary dynamically changed traffic in a strictly non-blocking way in SONET/WDM rings. Two splitting methods: traffic-cutting and traffic-dividing are introduced, and the third method, dividing a traffic first and then cutting it, is also proposed. The grooming performance for static and dynamic traffic with these three methods is analyzed in detail. A genetic algorithm (GA) based on these methods is proposed. Computer simulation results under different conditions show that our algorithm is efficient in reducing both the numbers of ADM's and wavelengths required.