Hierarchical traffic grooming: A tutorial

Traffic grooming is concerned with the design, operation, and control of networks with multigranular bandwidth demands. As the number of resources in a multigranular network increases rapidly with the network size, wavelength capacity, and load, a scalable framework for managing these entities becomes essential. Hierarchical traffic grooming facilitates the control and management of multigranular WDM networks. In this paper, we present a survey of traffic grooming schemes for optical networks that make use of architectures, algorithms and design techniques that impose a hierarchical structure on the network topology.

[1]  S. Baroni,et al.  Wavelength requirements in arbitrarily connected wavelength-routed optical networks , 1997 .

[2]  David B. Shmoys,et al.  A Best Possible Heuristic for the k-Center Problem , 1985, Math. Oper. Res..

[3]  Eytan Modiano,et al.  Dynamic routing and wavelength assignment with optical bypass using ring embeddings , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..

[4]  Jian-Qiang Hu,et al.  Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks , 2004, IEEE INFOCOM 2004.

[5]  George N. Rouskas,et al.  A framework for hierarchical traffic grooming in WDM networks of general topology , 2005, 2nd International Conference on Broadband Networks, 2005..

[6]  Geraldo Robson Mateus,et al.  A Lagrangian-based heuristic for traffic grooming in WDM optical networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[7]  S. Baroni,et al.  Wavelength-requirements in wavelength-routed optical networks , 1997 .

[8]  V. R. Konda,et al.  Algorithm for traffic grooming in optical networks to minimize the number of transceivers , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[9]  Ori Gerstel,et al.  Cost effective traffic grooming in WDM rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[10]  Biswanath Mukherjee,et al.  A Review of Traffic Grooming in WDM Optical Networks: Architectures and Challenges , 2002 .

[11]  G.N. Rouskas,et al.  On Hierarchical Traffic Grooming in WDM Networks , 2008, IEEE/ACM Transactions on Networking.

[12]  E. K. Park,et al.  A genetic algorithm for traffic grooming in all-optical mesh networks , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[13]  George N. Rouskas,et al.  A hierarchical model for multigranular optical networks , 2008, 2008 5th International Conference on Broadband Communications, Networks and Systems.

[14]  Adel A. M. Saleh,et al.  Quantifying the benefit of wavelength add-drop in WDM rings with distance-independent and dependent traffic , 1999 .

[15]  Zeyu Liu,et al.  Scalable traffic grooming in optical networks , 2012, 2012 Asia Communications and Photonics Conference (ACP).

[16]  Kia Makki,et al.  Traffic grooming on general topology WDM networks , 2003 .

[17]  George N. Rouskas,et al.  On optimal traffic grooming in WDM rings , 2002, IEEE J. Sel. Areas Commun..

[18]  George N. Rouskas,et al.  Clustering for Hierarchical Traffic Grooming in Large Scale Mesh WDM Networks , 2007, ONDM.

[19]  Biswanath Mukherjee,et al.  Some principles for designing a wide-area WDM optical network , 1996, TNET.

[20]  Biswanath Mukherjee,et al.  Traffic grooming in an optical WDM mesh network , 2002, IEEE J. Sel. Areas Commun..

[21]  Teofilo F. GONZALEZ,et al.  Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..

[22]  George N. Rouskas,et al.  Traffic grooming in WDM networks: past and future , 2002, IEEE Netw..

[23]  George N. Rouskas,et al.  An efficient algorithm for solving traffic grooming problems in optical networks , 2013, 2013 IEEE International Conference on Communications (ICC).

[24]  P. Baran,et al.  On Distributed Communications Networks , 1964 .

[25]  George N. Rouskas,et al.  Hierarchical traffic grooming formulations , 2013, 2013 IEEE Global Communications Conference (GLOBECOM).

[26]  Imrich Chlamtac,et al.  Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..

[27]  Eytan Modiano,et al.  Dynamic routing and wavelength assignment with optical bypass using ring embeddings , 2004 .

[28]  Wayne D. Grover,et al.  A new approach to node-failure protection with span-protecting p-cycles , 2009, 2009 11th International Conference on Transparent Optical Networks.

[29]  G.N. Rouskas,et al.  On the application of K-center algorithms to hierarchical traffic grooming , 2005, 2nd International Conference on Broadband Networks, 2005..

[30]  G. N. Rouskas,et al.  Traffic grooming in optical networks: Decomposition and partial linear programming (LP) relaxation , 2013, IEEE/OSA Journal of Optical Communications and Networking.

[31]  Peng-Jun Wan,et al.  Grooming of arbitrary traffic in SONET/WDM BLSRs , 2000, IEEE Journal on Selected Areas in Communications.

[32]  George N. Rouskas,et al.  Traffic Grooming in Star Networks , 2004 .

[33]  George N. Rouskas,et al.  Power Efficient Traffic Grooming in Optical WDM Networks , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.