Eecient Routing in All-optical Networks

Communication in all-optical networks requires novel routing paradigms. The high bandwidth of the optic ber is utilized through wavelength-division multiplexing: A single physical optical link can carry several logical signals, provided that they are transmitted on diierent wavelengths. We study the problem of routing a set of requests (each of which is a pair of nodes to be connected by a path) on sparse networks using a limited number of wavelengths, ensuring that diierent paths using the same wavelength never use the same physical link. The constraints on the selection of paths and wavelengths depend on the type of photonic switches used in the network. We present ee-cient routing techniques for the two types of photonic switches that dominate current research in all-optical networks. Our results es-0 tablish a connection between the expansion of a network and the number of wavelengths required for routing on it.

[1]  F. Harary,et al.  The theory of graphs and its applications , 1963 .

[2]  Stewart D. Personick,et al.  Review of Fundamentals of Optical Fiber Systems , 1983, IEEE J. Sel. Areas Commun..

[3]  N. Alon.  Eigenvalues and expanders , 1986, Comb..

[4]  Mark Jerrum,et al.  Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, WG.

[5]  H. Scott Hinton,et al.  Architectural considerations for photonic switching networks , 1988, IEEE J. Sel. Areas Commun..

[6]  Charles A. Brackett,et al.  Dense Wavelength Division Multiplexing Networks: Principles and Applications , 1990, IEEE J. Sel. Areas Commun..

[7]  Kavita Bala,et al.  Algorithms for routing in a linear lightwave network , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[8]  Fillia Makedon,et al.  Fast approximation algorithms for multicommodity flow problems , 1991, STOC '91.

[9]  Éva Tardos,et al.  Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

[11]  Mario Gerla,et al.  Rooted routing in linear lightwave networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[12]  P.A. Humblet,et al.  Bounds On The Number Of Wavelengths Needed In WDM Networks , 1992, Summer Topical Meeting Digest on Broadband Analog and Digital Optoelectronics, Optical Multiple Access Networks, Integrated Optoelectronics, Smart Pixels.

[13]  Alan M. Frieze,et al.  Existence and construction of edge disjoint paths on expander graphs , 1992, STOC '92.

[14]  Rajesh K. Pankaj.  Architectures for linear lightwave networks , 1992 .

[15]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

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

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

[18]  Yossi Azar,et al.  Competitive routing of virtual circuits with unknown duration , 1994, SODA '94.

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

[20]  Philip N. Klein,et al.  Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts , 1994, SIAM J. Comput..

[21]  Galen H. Sasaki,et al.  Scheduling transmissions in WDM broadcast-and-select networks , 1994, TNET.

[22]  Pierre A. Humblet,et al.  On the number of wavelengths and switches in all-optical networks , 1994, IEEE Trans. Commun..

[23]  Éva Tardos,et al.  Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..