Grooming of dynamic traffic in WDM star and tree networks using a genetic algorithm |
| |
| Authors: | Kun-Hong Liu Yong Xu De-Shuang Huang Min Cheng |
| |
| Affiliation: | (1) Intelligent Computing Lab, Hefei Institute of Intelligent Machines, Chinese Academy of Sciences, P.O. Box 1130, Hefei, Anhui, 230031, China;(2) Department of Automation, University of Science and Technology of China, Hefei, Anhui, 230026, China;(3) School of Medicine, The University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK;(4) Department of Physics and Electronic Information Engineering, Minjiang University, Fuzhou, 350108, China |
| |
| Abstract: | The advances in WDM technology lead to the great interest in traffic grooming problems. As traffic often changes from time
to time, the problem of grooming dynamic traffic is of great practical value. In this article, we discuss the dynamic grooming
of traffic in star and tree networks. A genetic algorithm (GA) based approach is proposed to support arbitrary dynamic traffic
patterns, which minimizes the number of ADMs and wavelengths. To evaluate the algorithm, tighter bounds are derived. Computer
simulation results show that our algorithm is efficient in reducing both the number of ADMs and wavelengths in tree and star
networks. |
| |
| Keywords: | WDM Traffic grooming Genetic algorithm Dynamic traffic Tree network |
| 本文献已被 SpringerLink 等数据库收录！ |
|
