Efficient Collective Communication in Optical Networks

This paper studies the problems of broadcasting and gossiping in optical networks. In such networks the vast bandwidth available is utilized through wavelength division multiplexing: a single physical optical link can carry several logical signals, provided that they are transmitted on different wavelengths. In this paper we consider both single-hop and multihop optical networks. In single-hop networks the information, once transmitted as light, reaches its destination without being converted to electronic form in between, thus reaching high speed communication. In multihop networks a packet may have to be routed through a few intermediate nodes before reaching its final destination. In both models we give efficient broadcasting and gossiping algorithms, in terms of time and number of wavelengths. We consider both networks with arbitrary topologies and particular networks of practical interest. Several of our algorithms exhibit optimal performances.

[1]  Kwok-Wai Cheung,et al.  Acoustooptic Tunable Filters in Narrowband WDM Networks: System Issues and Network Applications , 1990, IEEE J. Sel. Areas Commun..

[2]  Juraj Hromkovic,et al.  Optimal Algorithms for Disemination of Information in Generalized Communication Modes , 1992, PARLE.

[3]  Andrzej Pelc.  Fault‐tolerant broadcasting and gossiping in communication networks , 1996 .

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

[5]  Galen H. Sasaki,et al.  A linear lightwave Benes network , 1993, TNET.

[6]  Juraj Hromkovic,et al.  Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes , 1997, Inf. Comput..

[7]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[8]  Jack J. Dongarra,et al.  Software Libraries for Linear Algebra Computations on High Performance Computers , 1995, SIAM Rev..

[9]  K. Nosu,et al.  Epilog-latest advances in dense WDM technology , 1990 .

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

[11]  Alastair D. McAulay,et al.  Optical computer architectures , 1991 .

[12]  Guy Kortsarz,et al.  Approximation Algorithms for Minimum-Time Broadcast , 1995, SIAM J. Discret. Math..

[13]  Patrick Solé,et al.  Expanding and Forwarding , 1995, Discret. Appl. Math..

[14]  B. Mukherjee,et al.  WDM-based local lightwave networks. II. Multihop systems , 1992, IEEE Network.

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

[16]  Satish Rao,et al.  Efficient access to optical bandwidth , 1995, FOCS 1995.

[17]  Yuval Rabani,et al.  Improved bounds for all optical routing , 1995, SODA '95.

[18]  Jaroslav Opatrny,et al.  Forwarding indices of consistent routings and their complexity , 1994, Networks.

[19]  Arthur M. Farley.  Minimum-time line broadcast networks , 1980, Networks.

[20]  Luisa Gargano,et al.  Communication complexity of fault-tolerant information diffusion , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

[21]  Complexity of the Forwarding Index Problem , 1993, SIAM J. Discret. Math..

[22]  B. Mukherjee,et al.  WDM-based local lightwave networks. I. Single-hop systems , 1992, IEEE Network.

[23]  Noga Alon,et al.  lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.

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

[25]  R. Ravi,et al.  Rapid rumor ramification: approximating the minimum broadcast time , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[26]  G. C. Fox,et al.  Solving Problems on Concurrent Processors , 1988 .

[27]  Satish Rao,et al.  Efficient access to optical bandwidth wavelength routing on directed fiber trees, rings, and trees of rings , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[28]  Ming-Yang Kao,et al.  Optimal Broadcast in All-Port Wormhole-Routed Hypercubes , 1994, IEEE Trans. Parallel Distributed Syst..

[29]  Bojan Mohar,et al.  Isoperimetric numbers of graphs , 1989, J. Comb. Theory, Ser. B.

[30]  Eli Upfal,et al.  Efficient routing in all-optical networks , 1994, STOC '94.

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

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

[33]  Ouri Wolfson,et al.  The Communication Complexity of Atomic Commitment and of Gossiping , 1991, SIAM J. Comput..

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

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

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

[37]  Pierre Fraigniaud,et al.  Methods and problems of communication in usual networks , 1994, Discret. Appl. Math..

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

[39]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

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