Combining GA with Splitting Methods for Rearrangeably Nonblocking Grooming of Dynamic Traffic in SONET Ring Networks |
| |
Authors: | Kun-hong?Liu Email author" target="_blank">Yong?XuEmail author |
| |
Affiliation: | (1) School of Physics and Optoelectronics Technology, Fujian Normal University, Fuzhou, Fujian, 350007, P. R. China;(2) School of Computer Science, The University of Birmingham, Edgbaston, Birmingham, B15 2TT, United Kingdom |
| |
Abstract: | SONET/WDM rings are widely deployed in today’s networks. To reduce the total cost of such a network, an efficient way is using the traffic grooming technique to minimize the number of add/drop multiplexers (ADMs) on the ring. Since traffic often changes frequently, the problem of supporting dynamic traffic patterns with minimum number of ADMs and wavelengths becomes incresingly important, which is referred to as grooming of dynamic traffic. In this paper, we will deal with rearrangeably nonblocking grooming of arbitrary dynamic traffic in such ring networks. We will discuss in detail the benefit of splitting methods to such a grooming way and apply them to this kind of grooming. A novel genetic algorithm (GA) approach with a hierarchical chromosome structure for each individual is proposed in combination with splitting methods to address such grooming problems. Computer simulation results under different conditions show that our algorithm is efficient in reducing both the numbers of ADMs and wavelengths. |
| |
Keywords: | SONET/WDM ring network traffic grooming genetic algorithm traffic splitting rearrangeably nonblocking grooming |
本文献已被 SpringerLink 等数据库收录! |
|