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.
Similar content being viewed by others
References
A.L. Chiu E.H. Modiano (January 2000) ArticleTitleTraffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks IEEE/OSA Journal of Lightwave Technology 18 IssueID1 1–12
X.J. Zhang C.M. Qiao (October 2000) ArticleTitleAn effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings IEEE/ACM Transactions on networking 8 IssueID5 608–617 Occurrence Handle10.1109/90.879347
J. Wang W.H. Cho V.R. Vemuri B. Mukherjee (November 2001) ArticleTitleImproved approaches for cost-effective traffic grooming in WDM ring networks: ILP formulations and single-hop and multihop connections IEEE/OSA Journal of Lightwave Technology 19 IssueID11 1645–1653 Occurrence Handle10.1109/50.964064
Dutta R., Rouskas G.N., Traffic grooming in WDM networks: Past and future. IEEE Network, (November/December 2002) 46–56.
Y. Xu S.C. Xu B.X. Wu (July 2002) ArticleTitleTraffic grooming in unidirectional WDM ring networks using genetic algorithms Computer Communications 25 IssueID13 1185–1194 Occurrence Handle10.1016/S0140-3664(02)00007-5
R. Berry E.H. Modiano (October 2000) ArticleTitleReducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic IEEE Journal on Selected Areas in Communications 18 IssueID10 1961–1971
Y. Xu C.S. Xu B.X. Wu (January 2003) ArticleTitleStrictly nonblocking grooming of dynamic traffic in unidirectional SONET/WDM rings using genetic algorithm Computer Network 41 IssueID2 227–245 Occurrence Handle10.1016/S1389-1286(02)00385-7
K.H. Liu Y. Xu (October 2004) ArticleTitleA New approach to improving the grooming performance with dynamic traffic in SONET rings Computer Networks 46 IssueID2 181–195 Occurrence Handle10.1016/j.comnet.2004.03.031
J. Xu Q. Zeng (July 2001) ArticleTitleDynamic traffic grooming in interconnected WDM SDH/SONET rings Proc. of SPIE 4527 176–185
S. Zhang B. Ramamurthy (September 2003) ArticleTitleDynamic traffic grooming algorithms for reconfigurable SONET over WDM networks IEEE Journal on Selected Areas in Communications 21 IssueID7 1165–1172 Occurrence Handle10.1109/JSAC.2003.815844
Y. Xu X. Yao (June 2004) ArticleTitleLower bound on number of ADMs in WDM rings with nonuniform traffic demands Electronics Letters 40 IssueID13 824–825 Occurrence Handle10.1049/el:20040525
. Xu Y., Xu S.C., Heuristic operators, redundant mapping and other issues in genetic algorithms. In Proceedings of the CEC2001, Seoul, Korea), (May 2001), pp.1398–1405.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, Kh., Xu, Y. Combining GA with Splitting Methods for Rearrangeably Nonblocking Grooming of Dynamic Traffic in SONET Ring Networks. Photon Netw Commun 10, 179–192 (2005). https://doi.org/10.1007/s11107-005-2482-4
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11107-005-2482-4