Abstract
In a wavelength division multiplexing (WDM) network, sub-wavelength traffic streams can be elaborately arranged in wavelength channels to minimize the number of required electronic end systems, known as the traffic grooming problem. In this paper, a modified genetic algorithm without crossover operation is proposed to solve the problem using a permutation-based chromosome representation and using a selection strategy of reproducing the best chromosomes, thereby minimizing the number of electronic devices and requiring less wavelengths. Then, three methods are developed to improve the performance of the algorithm and a hill-climbing algorithm is proposed for the same purpose. Computer simulations were performed with plenty of randomly generated traffic patterns in unidirectional rings. The results show that these methods can improve the algorithm considerably. The relationships between the minimized network cost and the number of nodes are also presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Modiano, P. J. Lin, Traffic grooming in WDM networks, IEEE Communications Magazine, vol. 39, no. 7, (July 2001), pp. 124–129.
J. M. Simmons, E. L. Goldstein, A. A. M. Saleh, Quantifying the benefit of wavelength add-drop in WDM rings with distance-independent and dependent traffic, IEEE/OSA Journal of Lightwave Technology, vol. 17, no. 1, (Jan. 1999), pp. 49–57.
A. L. Chiu, E. H. Modiano, Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks, IEEE/OSA Journal of Lightwave Technology, vol. 18, no. 1, (Jan. 2000), pp. 2–12.
0. Gestel, P. Lin, G. Sasaki, Combined WDM and SONET network design. Proceedings of IEEE INEOCOM '99, vol. 2, (New York, USA, March 1999), pp. 734–743.
0. Gerstel, R. Ramaswami, G. H. Sasaki, Cost-effective traffic grooming in WDM rings, IEEE/ACM Transactions on Networking, vol. 8, no. 5, (Oct. 2000), pp. 618–630.
P-J. Wan, Gruia Calinescu, Liwu Liu, et al., Grooming of Arbitrary Traffic in SONET/WDM BLSRs, IEEE Journal on Selected Areas in Communications, vol. 18, no. 10, (Oct. 2000), pp. 1995–2003.
X. Zhang, C. Qiao, An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/ WDM rings, IEEE/ACM Transactions on Networking, vol. 8, no. 5, (Oct. 2000), pp. 608–617.
J. Wang, W. Cho, V. Rao Vernuri, et al., Improved approaches for cost-effective traffic grooming in WDM ring networks: ILP formulations and single-hop and multihop connections, IEEE/OSA Journal of Lightwave Technology, vol. 19, no. 11, (Nov. 2001), pp. 1645–1653.
H.-W. Tzeng, J.-L. Chen, N.-K. Chen, Traffic grooming in WDM networks using genetic algorithm. Proceedings of IEEE SMC '99, vol. 1, (Tokyo, Japan, Oct. 1999), pp. 1003–1006.
J. Xu, Q. Zeng, Reducing electronic multiplexing in WDM rings: An evolutionary approach. Proceedings of International Conferences on Info-tech and Info-net, vol. 2, (Beijing, China, Oct. 2001), pp. 168–173.
Y. Xu, S.-C. Xu, B.-X. Wu, Traffic grooming in unidirectional WDM ring network using genetic algorithms. Computer Communications, vol. 25,no. 13, (Aug. 2002),pp. 1185–1194.
Y. Xu, S.-C. Xu, B.-X. Wu, Strictly nonblocking grooming of dynamic traffic in unidirectional SONET/WDM rings using genetic algorithms. Computer Networks, vol. 41, no. 2, (Feb. 2003), pp. 227–245.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jiao, Y., Zhou, B., Zhang, H. et al. Heuristic Algorithms for Grooming of Arbitrary Traffic in WDM Ring Networks. Photonic Network Communications 8, 309–318 (2004). https://doi.org/10.1023/B:PNET.0000041240.50902.5b
Issue Date:
DOI: https://doi.org/10.1023/B:PNET.0000041240.50902.5b