Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems

This paper surveys theoretical results for wavelength—routing in all—optical networks and presents several open problems. We focus our attention on graph-theoretical problems and proof techniques.

[1]  Stéphane Pérennes,et al.  Efficient Collective Communication in Optical Networks , 1996, ICALP.

[2]  David Hung-Chang Du,et al.  Distributed computing with high-speed optical networks , 1993, Computer.

[3]  R. Ramaswami,et al.  Multiwavelength lightwave networks for computer communication , 1993, IEEE Communications Magazine.

[4]  Klaus Jansen,et al.  Scheduling of Virtual Connections in Fast Networks , 1996, Universität Trier, Mathematik/Informatik, Forschungsbericht.

[5]  Vijay Kumar,et al.  Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks , 1998, APPROX.

[6]  Ioannis Caragiannis,et al.  Efficient wavelength routing in trees with low-degree converters , 1998, Multichannel Optical Networks: Theory and Practice.

[7]  Martin Charles Golumbic,et al.  Edge and vertex intersection of paths in a tree , 1985, Discret. Math..

[8]  Clyde L. Monma,et al.  Intersection graphs of paths in a tree , 1986, J. Comb. Theory, Ser. B.

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

[10]  Noga Alon,et al.  Eigenvalues and expanders , 1986, Comb..

[11]  J. E. Midwinter.  Optical Computer Architectures , 1991 .

[12]  Stéphane Pérennes,et al.  Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing , 1997, ICALP.

[13]  Klaus Jansen,et al.  Constrained Bipartite Edge Coloring with Applications to Wavelength Routing , 1997, ICALP.

[14]  W. Mader,et al.  Minimalen-fach kantenzusammenhängende Graphen , 1971 .

[15]  Alok Aggarwal,et al.  Efficient routing and scheduling algorithms for optical networks , 1994, SODA '94.

[16]  R. M. Tanner.  Explicit Concentrators from Generalized N-Gons , 1984 .

[17]  Stéphane Pérennes,et al.  Optimal Wavelength-routed Multicasting , 1998, Discret. Appl. Math..

[18]  Peter Winkler,et al.  Ring routing and wavelength translation , 1998, SODA '98.

[19]  Ralf Klasing,et al.  Methods and Problems of Wavelength-Routing in All-Optical Networks , 1998 .

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

[21]  Rudolf Ahlswede,et al.  Fault-tolerant minimum broadcast networks , 1996 .

[22]  M. Murty.  Ramanujan Graphs , 1965 .

[23]  Rajiv Ramaswami,et al.  Multiwavelength optical networks with limited wavelength conversion , 1998, TNET.

[24]  Bruno Beauquier.  All-to-All Communication for some Wavelength-Routed All-Optical Networks , 1999 .

[25]  L. Gargano.  Colouring all directed paths in a symmetric tree with applications to WDM routing , 1997 .

[26]  Vijay Kumar,et al.  Improved access to optical bandwidth in trees , 1997, SODA '97.

[27]  Martin Charles Golumbic,et al.  The edge intersection graphs of paths in a tree , 1985, J. Comb. Theory, Ser. B.

[28]  Jean-Claude Bermond,et al.  Large fault-tolerant interconnection networks , 1989, Graphs Comb..

[29]  Amit Kumar,et al.  Wavelength conversion in optical networks , 1999, SODA '99.

[30]  Luisa Gargano,et al.  Limited Wavelength Conversion in All-Optical Tree Networks , 1998, ICALP.

[31]  W. Mader.  Minimale n-fach kantenzusammenh angende graphen , 1971 .

[32]  A. Tucker,et al.  Coloring a Family of Circular Arcs , 1975 .