On the complexity and algorithm of grooming regular traffic in WDM optical networks

Journal of Parallel and Distributed Computing

Volumn 68, Issue 6, 2008, Pages 877-886

  Wang, Yong ^a   Gu, Qian Ping ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Approximation algorithm; Graph partition; NP completeness; SONET WDM networks; Traffic grooming

Indexed keywords

APPROXIMATION ALGORITHMS; TELECOMMUNICATION TRAFFIC; WAVELENGTH; WAVELENGTH DIVISION MULTIPLEXING;

GRAPH PARTITION; TRAFFIC GROOMING; WDM NETWORKS;

FIBER OPTIC NETWORKS;

EID: 43049165924     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2008.01.001     Document Type: Article

References (22)

1. J.-C. Bermond, D. Coudert, Traffic grooming in unidirectional WDM ring networks using design theory, in: Proceedings of IEEE ICC'03, 2003, pp. 1995-2003
2. Biedl T., Demaine E.D., Duncan C.A., Fleischer R., and Kobourov S.G. Tight bounds on maximal and maximum matchings. Discrete Mathematics 285 (2004) 7-15
3. Brauner N., Crama Y., Finke G., Lemaire P., and Wynants C. Approximation algorithms for the design of SDH/SONET networks. RAIRO Operations Research 37 (2003) 235-247
4. Bernstein G., Rajagopalan B., and Saha D. Optical Network Control: Architecture, Protocols, and Standards (2004), Addison Wesley Professional, Boston
5. Chen L.-W., and Modiano E. Efficient routing and wavelength assignment for reconfigurable WDM networks with wavelength converters. IEEE/ACM Transactions on Networking 13 1 (2005) 173-186
6. Dutta R., and Rouskas G.N. Traffic grooming in WDM networks: Past and future. IEEE Network 16 6 (2002) 46-56
7. O. Gerstel, P. Lin, G. Sasaki, Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings, in: Proceedings of IEEE INFOCOM'98, 1998, pp. 94-101
8. O. Gerstel, P. Lin, G. Sasaki, Combined WDM and SONET network design, in: Proceedings of IEEE INFOCOM'99, 1999, pp. 734-743
9. Goldschmidt O., Hochbaum D.S., Levin A., and Olinick E.V. The SONET edge-partition problem. Network 41 1 (2003) 13-23
10. Holyer I. The NP-completeness of some edge-partition problems. SIAM Journal on Computing 10 (1981) 713-717
11. Hu J.Q. Optimal traffic grooming for wavelength-division-multiplexing rings with all-to-all uniform traffic. Journal of Optical Networking 1 1 (2002) 32-42
12. Modiano E., and Chiu A. Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. Journal of Lightwave Technology 18 1 (2000) 2-12
13. Meringer M. Genreg: A very fast structure generator for regular graphs. http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html
14. Modiano E., and Lin P. Traffic grooming in WDM networks. IEEE Communications Magazine 39 7 (2001) 124-129
15. Narula-Tam A., Lin P.J., and Modiano E. Efficient routing and wavelength assignment for reconfigurable WDM networks. IEEE Journal of Selected Areas in Communications 20 1 (2002) 75-88
16. A.K. Somani, Survivable traffic grooming in WDM networks, in: Proceedings of the International Conference on Broad-Band Optical Fibre Communication Technology (BBOFCT'01), 2001, pp. 17-45
17. Vizing V.G. On an estimate of the chromatic class of a p-graph. Metody Discret Analiz. 3 (1964) 25-30 (in Russian)
18. Y. Wang, Q.-P. Gu, Grooming of symmetric traffic in unidirectional SONET/WDM rings, Technical Report 2005-15, School of Computing Science, Simon Fraser University, 2005
19. Y. Wang, Q.-P. Gu, Grooming of symmetric traffic in unidirectional SONET/WDM rings, in: Proceedings of IEEE ICC'06
20. West D.B. Introduction to Graph Theory (1996), Prentice Hall Inc., Upper Saddle River, NJ
21. Zhang X., and Qiao C. An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings. IEEE/ACM Transactions on Networking 8 5 (2000) 608-617
22. Zhu K., and Mukherjee B. A review of traffic grooming in WDM optical networks: Architectures and challenges. Optical Networks Magazine 4 2 (2003) 55-64