Traffic Grooming: Combinatorial Results and Practical Resolutions

In an optical network using the wavelength division multiplexing (WDM) technology, routing a request consists of assigning it a route in the physical network and a wavelength. If each request uses 1/g of the bandwidth of the wavelength, we will say that the grooming factor is g. That means that on a given edge of the net- work we can groom (group) at most g requests on the same wavelength. With this constraint the objective can be either to minimize the number of wavelengths (re- lated to the transmission cost) or minimize the number of Add/Drop Multiplexers (shortly ADM ) used in the network (related to the cost of the nodes). Here, we first survey the main theoretical results obtained for different grooming

[1]  Gianpiero Monaco,et al.  Approximating the traffic grooming problem in tree and star networks , 2008, J. Parallel Distributed Comput..

[2]  Jean-Claude Bermond,et al.  Traffic grooming on the path , 2007, Theor. Comput. Sci..

[3]  David Coudert,et al.  Traffic grooming in unidirectional WDM ring networks using design theory , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[4]  Biswanath Mukherjee,et al.  Traffic Grooming and Delay Constrained Multicast Routing in IP over WDM Networks , 2008, 2008 IEEE International Conference on Communications.

[5]  Charles J. Colbourn,et al.  Grooming in unidirectional rings: K4-e designs , 2004, Discret. Math..

[6]  Deborah Brungard,et al.  Requirements for GMPLS-Based Multi-Region and Multi-Layer Networks (MRN/MLN) , 2008, RFC.

[7]  Tibor Cinkler,et al.  Iterative Multi-Hop Wavelength Routing Through Decomposition , 2000 .

[8]  Rajiv Ramaswami,et al.  Optical Networks , 1998 .

[9]  T. Cinkler,et al.  Protection for adaptive multi-layer traffic engineering , 2007, 2007 6th International Workshop on Design and Reliable Communication Networks.

[10]  Jian Wang,et al.  Improved approaches for cost-effective traffic grooming in WDM ring networks: ILP formulations and single-hop and multihop connections , 2001 .

[11]  T. Cinkler,et al.  Ethernet over WDM: Optimization for resilience and scalability , 2007, 2007 6th International Workshop on Design and Reliable Communication Networks.

[12]  Prudence W. H. Wong,et al.  Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks , 2007, DISC.

[13]  Biswanath Mukherjee,et al.  Traffic Grooming in Optical WDM Mesh Networks , 2005 .

[14]  Charles J. Colbourn,et al.  Minimizing drop cost for SONET/WDM networks with ⅛ wavelength requirements , 2001 .

[15]  Eytan Modiano,et al.  Uniform versus non-uniform band switching in WDM networks , 2006, Comput. Networks.

[16]  Peng-Jun Wan,et al.  Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs , 2002, J. Comb. Optim..

[17]  Arun Somani,et al.  Survivability and Traffic Grooming in WDM Optical Networks: References , 2006 .

[18]  Tibor Cinkler.  On ‘ a priori ’ and ‘ a posteriori ’ Multi-Layer Traffic Engineering Schemes , .

[19]  T. Cinkler,et al.  Grooming node placement in switched multilayer networks~ , 2005, Conference onOptical Network Design and Modeling, 2005..

[20]  Eric Mannie,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Architecture , 2004, RFC.

[21]  Peng-Jun Wan,et al.  Minimizing electronic line terminals for automatic ring protection in general WDM optical networks , 2002, IEEE J. Sel. Areas Commun..

[22]  Stéphane Pérennes,et al.  Degree-Constrained Subgraph Problems: Hardness and Approximation Results , 2008, WAOA.

[23]  Tibor Cinkler.  Heuristic algorithms for configuration of the ATM-layer over optical networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[24]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[25]  T. Cinkler,et al.  Restoration of multi-cast trees in optical-beared grooming-capable two-layer networks , 2008, 2008 10th Anniversary International Conference on Transparent Optical Networks.

[26]  Jean-Claude Bermond,et al.  Traffic Grooming in Bidirectional WDM Ring Networks , 2006, 2006 International Conference on Transparent Optical Networks.

[27]  Peng-Jun Wan,et al.  Traffic partition in WDM/SONET rings to minimize SONET ADMs , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[28]  Michal Pióro,et al.  Optimal Virtual Topology Design using Bus-Label Switched Paths , 2007, IEEE Journal on Selected Areas in Communications.

[29]  Ramón Fabregat,et al.  G+: Enhanced Traffic Grooming in WDM Mesh Networks using Lighttours , 2007, IEEE Journal on Selected Areas in Communications.

[30]  Gennian Ge,et al.  Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven , 2008, SIAM J. Discret. Math..

[31]  Imrich Chlamtac,et al.  Waveband switching in light trail optical networks with dynamic traffic [Invited] , 2006 .

[32]  T. Cinkler,et al.  Multi-layer traffic engineering schemes in GMPLS networks , 2005, Proceedings of 2005 7th International Conference Transparent Optical Networks, 2005..

[33]  M. Kohn.  A new efficient online-optimization approach for SDH/SONET-WDM multi layer networks , 2006, 2006 Optical Fiber Communication Conference and the National Fiber Optic Engineers Conference.

[34]  Imrich Chlamtac,et al.  Lightpath (Wavelength) Routing in Large WDM Networks , 1996, IEEE J. Sel. Areas Commun..

[35]  Jason P. Jue,et al.  Waveband Switching, Routing, and Grooming: introduction to the feature issue , 2007 .

[36]  Philip J. Lin,et al.  The ring grooming problem , 2004, Networks.

[37]  Adrian Sampson,et al.  On-line Distributed Traffic Grooming , 2008, 2008 IEEE International Conference on Communications.

[38]  Ori Gerstel,et al.  Wavelength assignment in a WDM ring to minimize cost of embedded SONET 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.

[39]  P. Hell,et al.  Graph Problems Arising from Wavelength-Routing in All-Optical Networks , 2004 .

[40]  Tibor Cinkler,et al.  Configured vs Switched Underlying Wavelength System for Traffic Engineering with Grooming , 2006 .

[41]  C. Colbourn,et al.  The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[42]  Shmuel Zaks,et al.  On the Complexity of the Traffic Grooming Problem in Optical Networks , 2007, FUN.

[43]  Tibor Cinkler,et al.  Grooming-Enhanced Multicast in Multilayer Networks , 2007, ONDM.

[44]  Gianpiero Monaco,et al.  Selfishness, collusion and power of local search for the ADMs minimization problem , 2008, Comput. Networks.

[45]  T. Cinkler,et al.  On the Gain of Statistical Multiplexing Over Traffic Grooming , 2006, 2006 International Conference on Transparent Optical Networks.

[46]  T. Cinkler,et al.  Traffic grooming and power level tuning for physical impairment constrained routing , 2008, 2008 10th Anniversary International Conference on Transparent Optical Networks.

[47]  Vittorio Bilò,et al.  On Nash Equilibria in Non-cooperative All-Optical Networks , 2005, STACS.

[48]  T. Cinkler,et al.  Fairness Issues of AMLTE: Adaptive Multi-Layer Traffic Engineering with Grooming , 2007, 2007 9th International Conference on Transparent Optical Networks.

[49]  T. Cinkler,et al.  Joint grooming capability and wavelength number optimization , 2005, Proceedings of 2005 7th International Conference Transparent Optical Networks, 2005..

[50]  Jean-Claude Bermond,et al.  Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3 , 2003, Networks.

[51]  Xiang-Yang Li,et al.  Wavelength assignment in WDM rings to minimize SONET ADMs , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[52]  Dorit S. Hochbaum,et al.  The SONET edge-partition problem , 2003, Networks.

[53]  T. Cinkler,et al.  Regular reconfiguration of light-trees in multilayer optical networks , 2008, 2008 International Conference on Optical Network Design and Modeling.

[54]  Stéphane Pérennes,et al.  Traffic grooming in WDM networks with multi-layer switches , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[55]  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.

[56]  T. Cinkler,et al.  Design of traffic grooming optical virtual private networks obeying physical limitations , 2005, Second IFIP International Conference on Wireless and Optical Communications Networks, 2005. WOCN 2005..

[57]  Shmuel Zaks,et al.  On Minimizing the Number of ADMs in a General Topology Optical Network , 2006, DISC.

[58]  A.L. Chiu,et al.  Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks , 2000, Journal of Lightwave Technology.

[59]  George N. Rouskas,et al.  A Survey of Virtual Topology Design Algorithms for Wavelength Routed Optical Networks , 1999 .

[60]  Daniel Kofman,et al.  Bus-Label Switched Paths, an approach to reduce the cost of multilayer networks , 2006, 2006 IEEE International Conference on Communications.

[61]  Charles J. Colbourn,et al.  Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs , 2003, Discret. Math..

[62]  Eytan Modiano,et al.  Traffic grooming in WDM networks , 2001, IEEE Commun. Mag..

[63]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

[64]  T. Cinkler,et al.  Stalled information based routing in multidomain multilayer networks , 2004, 11th International Telecommunications Network Strategy and Planning Symposium. NETWORKS 2004,.

[65]  Eytan Modiano,et al.  Optimal waveband switching in WDM networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[66]  Shmuel Zaks,et al.  On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing , 2006, CAAN.

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

[68]  Tim Roughgarden,et al.  Selfish routing and the price of anarchy , 2005 .

[69]  Tibor Cinkler,et al.  Multi-Layer Traffic Engineering Through Adaptive lambda-Path Fragmentation and De-fragmentation , 2006, Networking.

[70]  Tibor Cinkler,et al.  Multilayer traffic engineering experimental demonstrator in the Nobel-II project , 2007 .

[71]  Daniel O. Awduche,et al.  IP over Optical Networks: A Framework , 2004, RFC.

[72]  Tibor Cinkler,et al.  Multilayer traffic engineering for GMPLS-enabled networks , 2005, IEEE Communications Magazine.

[73]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[74]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[75]  Murali S. Kodialam,et al.  Integrated dynamic IP and wavelength routing in IP over WDM networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[76]  Stéphane Pérennes,et al.  Hardness and Approximation of Traffic Grooming , 2007, ISAAC.

[77]  George N. Rouskas,et al.  Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms , 2003, IEEE Journal on Selected Areas in Communications.

[78]  Tibor Cinkler.  ILP Formulation of Grooming over Wavelength-Routing with Protection , 2001, ONDM.

[79]  Tibor Cinkler,et al.  Configuring Traffic Grooming VPλNs , 2004, Photonic Network Communications.

[80]  Tibor Cinkler,et al.  Heuristic algorithms for joint configuration of the optical and electrical layer in multi-hop wavelength routing networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[81]  Ahmed E. Kamal,et al.  Traffic Grooming for Optical Networks , 2008 .

[82]  Tibor Cinkler.  Traffic and ? grooming , 2003 .

[83]  Tibor Cinkler,et al.  Multi-Layer Traffic Engineering Through Adaptive λ-Path Fragmentation and De-fragmentation , 2006 .

[84]  Deborah Brungard,et al.  Internet Engineering Task Force (ietf) Generalized Mpls (gmpls) Protocol Extensions for Multi-layer and Multi-region Networks (mln/mrn) , 2022 .

[85]  Chunming Qiao,et al.  Waveband Switching for Dynamic Traffic Demands in Multigranular Optical Networks , 2007, IEEE/ACM Transactions on Networking.

[86]  T. Cinkler,et al.  /spl lambda/-path fragmentation and de-fragmentation through dynamic grooming , 2005, Proceedings of 2005 7th International Conference Transparent Optical Networks, 2005..

[87]  Chunming Qiao,et al.  An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings , 2000, TNET.

[88]  Tibor Cinkler,et al.  Approximative Algorithms for Con guration of Multi-Layer Networks with Protection , 2001 .

[89]  Shmuel Zaks,et al.  A 10/7 + /spl epsi/ approximation for minimizing the number of ADMs in SONET rings , 2004, First International Conference on Broadband Networks.

[90]  Shmuel Zaks,et al.  Approximating the traffic grooming problem , 2008, J. Discrete Algorithms.

[91]  Arun K. Somani.  Survivability and Traffic Grooming in WDM Optical Networks , 2006 .

[92]  David Coudert,et al.  Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6 , 2005, SIAM J. Discret. Math..

[93]  David Coudert,et al.  On DRC‐covering of Kn by cycles , 2003 .

[94]  Shmuel Zaks,et al.  Lightpath arrangement in survivable rings to minimize the switching cost , 2002, IEEE J. Sel. Areas Commun..

[95]  Tibor Cinkler,et al.  Adaptive Multi-Layer Traffic Engineering with Shared Risk Group Protection , 2008, 2008 IEEE International Conference on Communications.

[96]  Tibor Cinkler.  Traffic and /spl lambda/ grooming , 2003 .

[97]  Jian-Qiang Hu,et al.  Optimal traffic grooming for wavelength-division-multiplexing rings with all-to-all uniform traffic , 2002 .

[98]  Leah Epstein,et al.  Better Bounds for Minimizing SONET ADMs , 2004, WAOA.

[99]  Xavier Muñoz,et al.  Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph , 2008, WG.

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

[101]  Leah Epstein,et al.  SONET ADMs Minimization with Divisible Paths , 2005, WAOA.

[102]  David Coudert,et al.  Optimal Solution of the Maximum All Request Path Grooming Problem , 2006, Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services (AICT-ICIW'06).

[103]  T.H.B. Hendriks.  Integer linear programming , 2007 .

[104]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[105]  George N. Rouskas,et al.  Traffic Grooming for Optical Networks: Foundations, Techniques and Frontiers , 2008 .

[106]  Tibor Cinkler,et al.  Mutual Impact of Physical Impairments and Grooming in Multilayer Networks , 2007, ONDM.

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

[108]  Jean-Claude Bermond,et al.  Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case , 2003 .