Graph theory and traffic grooming in WDM rings

Abstract This paper has a double purpose. In the rst part ofthe paper we give an overvie w of different aspects ofgraph theory which can be applied in communicationengineering, not trying to present immediate resultsto be applied neither a complete surv ey of results, butto give a a vor of ho w graph theory can help researchin optical netw orks.The second part of this paper is a detailed exampleof the usage of graph theory ,but itis also a completesurv ey of recent results in minimization of the num-ber of add±drop multiple xers (ADMs) required in aWDM ring with trafc grooming. 1 Intr oduction.Some w ords about maths and en-gineering . It is not in the ne ws that the de velopment of sciencesand technology mak es it impossible to be aw are ofall elds of kno wledge, andspecialization cannot beavoided in the scientic research where the rapid ad-vances mak e itdifcult even to follo w the ne w resultsin the own specic discipline.This una voidable factturns out to be a strong limitation in thede velopmentof science, since man y achie ved results in somedis-ciplines that could be useful in other elds of kno wl-

[1]  Bruno Beauquier,et al.  All-to-all communication for some wavelength-routed all-optical networks , 1999, Networks.

[2]  M. Listanti,et al.  Packet loss in a bufferless optical WDM switch employing shared tunable wavelength converters , 2000, Journal of Lightwave Technology.

[3]  D Coudert,et al.  Topologies for optical interconnection networks based on the optical transpose interconnection system. , 2000, Applied optics.

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

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

[6]  Charles Delorme,et al.  Strategies for Interconnection Networks: Some Methods from Graph Theory , 1986, J. Parallel Distributed Comput..

[7]  Johanne Cohen,et al.  Unslotted deflection routing: a practical and efficient protocol for multihop optical networks , 2001, TNET.

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

[9]  Miguel Angel Fiol,et al.  Maximally connected digraphs , 1989, J. Graph Theory.

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

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

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

[13]  Marie-Claude Heydemann,et al.  On forwarding indices of networks , 1989, Discret. Appl. Math..

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

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

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

[17]  X. Munoz,et al.  A multihop multi-OPS optical interconnection network , 2000, Journal of Lightwave Technology.

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

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

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

[21]  Ayan Banerjee,et al.  Generalized multiprotocol label switching: an overview of signaling enhancements and recovery techniques , 2001, IEEE Commun. Mag..

[22]  Jean-Claude Bermond,et al.  Decomposition of complete graphs into isomorphic subgraphs with five vertices , 1980 .

[23]  Hervé Rivano,et al.  Fractional Path Coloring with Applications to WDM Networks , 2001, ICALP.

[24]  D. O. Awduche,et al.  MPLS and traffic engineering in IP networks , 1999, IEEE Commun. Mag..

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

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

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

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

[29]  Jean-Claude Bermond,et al.  De Bruijn and Kautz bus networks , 1997 .

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

[31]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[32]  G. Chartrand,et al.  Graphs & Digraphs , 1986 .

[33]  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).

[34]  Francesc Comellas,et al.  A multiagent system for frequency assignment in cellular radio networks , 2000, IEEE Trans. Veh. Technol..

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

[36]  J. Bermond,et al.  Graph decompositions and G-designs , 1976 .

[37]  Charles J. 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.

[38]  Juraj Hromkovič,et al.  Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping) , 1996 .

[39]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[40]  Fan Chung Graham,et al.  The forwarding index of communication networks , 1987, IEEE Trans. Inf. Theory.

[41]  Danny Dolev,et al.  A new look at fault tolerant network routing , 1984, STOC '84.

[42]  S C Esener,et al.  Optical transpose interconnection system architectures. , 1993, Optics letters.