Efficient collective communication in optical networks

Theoretical Computer Science

Volumn 233, Issue 1-2, 2000, Pages 165-189

  Bermond, Jean Claude ^a   Gargano, Luisa ^b   Perennes, Stephan ^a   Rescigno, Adele A ^b   Vaccaro, Ugo ^b  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b UNIVERSITY OF SALERNO   (Italy)

Author keywords

Broadcasting; Communication networks; Gossiping; Optical networks

Indexed keywords

EID: 0003342776     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00018-8     Document Type: Article

References (49)

1. A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, M. Sudan, Efficient routing and scheduling algorithms for optical networks, in: Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'94), 1994, pp. 412-423.
2. M. Ajmone Marsan, A. Bianco, E. Leonardi, F. Neri, Topologies for wavelength-routing for All-Optical networks, IEEE/ACM Trans. Networking 1 (5) (1993) 534-546.
3. Y. Aumann, Y. Rabani, Improved bounds for all optical routing, in: Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'95), 1995, pp. 567-576.
4. R.A. Barry, P.A. Humblet, Bounds on the number of wavelengths needed in WDM networks, in: LEOS '92 Summer Topical Mtg. Digest, 1992, pp. 21-22.
5. R.A. Barry, P.A. Humblet, On the number of wavelengths and switches in all-Optical Networks, IEEE Trans. Comm. Part I (1994) pp. 523-591.
6. K. Bala, T.E. Stern, D. Simchi-Levi, K. Bala, routing in linear lightwave networks, IEEE/ACM Trans. Networking 3 (1995) 459-469.
7. B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Perennes, U. Vaccaro, Graph problems arising from wavelength-routing in All-Optical Networks, 2nd Workshop on Optics and Computer Science (WOCS), Geneve, Switzerland, April 1997.
8. C. Berge, Graphs, North-Holland, Amsterdam.
9. J.-C. Bermond, N. Homobono, C. Peyrat, Large fault-tolerant interconnection networks, Graphs Combin. 5 (1989) 107-123.
10. D.P. Bertsekas, J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, NJ, 1989.
11. K.W. Cheng, Acousto-optic tunable filters in narrowband WDM networks, IEEE J. Selected Areas Comm. 8 (1990) 1015-1025.
12. N.K. Cheung et al., IEEE JSAC: Special Issue on Dense WDM Networks 8 (1990).
13. I. Chlamtac, A. Ganz, G. Karmi, Purely optical network for terabit communication, Proc. IEEE Infocom '89, 1989, pp. 887-896.
14. E. Desurvire, Erbium-Doped Fiber Amplifiers - Principles and Applications, Wiley, New York, 1994.
15. J.J. Dongarra, D.W. Walker, Software libraries for linear algebra computation on high performances computers, SIAM Rev. 37 (1995) 151-180.
16. T. Erlebach, K. Jansen, Scheduling of virtual connections in fast networks, Proc. 4th Workshop on Parallel Systems and Algorithms PASA '96, 1996, pp. 13-32.
17. A.M. Farley, Minimum-time line broadcast networks, NETWORKS, 10 (1980) 59-70.
18. R. Feldmann, J. Hromkovic, S. Madhavapeddy, B. Monien, P. Mysliwietz, Optimal algorithms for dissemination of information in generalised communication modes, in: Proc. Parallel Architectures and Languages Europe (PARLE '92), Lecture Notes in Computer Science, vol. 605, Springer, Berlin, 1992, pp. 115-130.
19. G. Fox, M. Johnsson, G. Lyzenga, S. Otto, J. Salmon, D. Walker, Solving Problems on Concurrent Processors, vol. I, Prentice Hall, Englewood Cliffs, NJ, 1988.
20. P. Fraignaud, E. Lazard, Methods and problems of communication in usual networks, Discrete Appl. Math. 53 (1994) 79-134.
21. P.E. Green, Fiber-Optic Communication Networks, Prentice-Hall, Englewood Cliffs, NJ, 1992.
22. P.E. Green, Optical networking update, IEEE J. Selected Areas in Comm. 14 (1996) 764-779.
23. S.M. Hedetniemi, S.T. Hedetniemi, A. Liestman, A survey of gossiping and broadcasting in communication networks, NETWORKS 18 (1988) 129-134.
24. M.C. Heydemann, J.C. Meyer, D. Sotteau, On forwarding indices of networks, Discrete Appl. Math. 23 (1989) 103-123.
25. C.-T. Ho, M.-Y. Kao, Optimal broadcast in all-port wormhole-routed hypercubes. IEEE Trans. Parallel Distributed Systems 6 (2) (1995) 200-204.
26. J. Hromkovič, R. Klasing, B. Monien, R. Peine, Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping), in: Ding-Zhu Du, D. Frank Hsu (Eds.), Combinatorial Network Theory, Kluwer Academic Publishers, Desdrecht, 1995, pp. 125-212.
27. J. Hromkovič, R. Klasing, W. Unger, H. Wagener, Optimal algorithms for broadcast and gossip in the edge-disjoint path modes, in: Proc. 4th Scandinavian Workshop on Algorithm Theory (SWAT'94), Lecture Notes in Computer Science, vol. 824, Springer, Berlin, 1994, pp. 219-230.
28. K. Kaklamanis, G. Persiano, Efficient wavelength routing in directed fiber trees, in: Diaz and Serna (Eds.) Proc. Ann. European Symp. on Algorithms, Lecture Notes in Computer Science, Springer, Berlin, 1996, pp. 460-470.
29. R. Klasing, The relationship between gossiping in vertex-disjoint paths mode and bisection width, proc. 19th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS'94), Lecture Notes in Computer Science, vol. 841, Springer, Berlin, 841, 1994, pp. 473-483.
30. D.W. Krumme, K.N. Venkataraman, G. Cybenko, Gossiping in minimal time, SIAM J. Comput. 21 (1992) 111-139.
31. F.T. Leighton, S. Rao, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, in: Proc. 29th Ann. IEEE Symp. on Foundations of Computer Science (FOCS'88), 1988, pp. 422-431.
32. K. Liu, R. Ramaswami, Analysis of optical bus networks using doped-fiber amplifiers, Proc. IEEE/LEOS Topical Meeting on Optical Multi-Access Networks, July 1990.
33. L. Lovász, Combinatorial Problem and Exercises, 2nd ed., Elsevier, Amsterdam, 1993.
34. W. Mader, Minimale n-fach Kantenzusammenhangende Graphen, Math. Ann. 191 (1971) 21-28.
35. A.D. McAulay, Optical Computer Architectures, Wiley, New York, 1991.
36. M. Mihail, K. Kaklamanis, S. Rao, Efficient access to optical bandwidth, in: Proc. 36th Ann. IEEE Symp. on Foundations of Computer Science (FOCS'95), 1995, pp. 548-557.
37. B. Mukherjee, WDM-based local lightwave networks, Part I: single-hop systems, IEEE Networks 6 (1992) 12-27.
38. B. Mukherjee, WDM-based local lightwave networks, Part II: multihop systems, IEEE Networks 6 (1992) 20-32.
39. R.K. Pankaj, Architectures for linear lightwave networks, Ph.D. Thesis, Dept. of Electrical Engineering and Computer Science, MIT, Cambridge, MA, 1992.
40. A. Pelc, Fault tolerant broadcasting and gossiping in communication networks, NETWORKS 28 (1996) 143-156.
41. S. Personick, Review of fundamentals of optical fiber systems, IEEE J. Selected Areas Comm. 3 (1983) 373-380.
42. G.R. Pieris, G.H. Sasaki, A linear lightwave Beneš network, IEEE/ACM Trans. Network 1 (1993) 441-445.
43. P. Raghavan, E. Upfal, Efficient routing in All-Optical Networks, in: Proc. 26th Ann. ACM Symp. on Theory of Computing (STOC'94)), 1994, pp. 133-143.
44. R. Ramaswami, Multi-wavelength lightwave networks for computer communication, IEEE Comm. Mag. 31 (1993) 78-88.
45. R. Ramaswami, K. Sivarajan, Routing and wavelength assignement in all-optical networks, IEEE/ACM Trans. Networking 3 (1995) 489-500.
46. R. Ramaswami, K. Sivarajan, Design of logical topologies for wavelength-routed optical networks, IEEE JSAC/JLT Special Issue on Optical Networks, June 1996.
47. P. Sole, Expanding and forwarding, Discrete Appl. Math. 58 (1995) 67-78.
48. R.J. Vetter, D.H.C. Du, Distributed computing with high-speed optical networks, IEEE Comput. 26, (1993) 8-18.
49. O. Wolfson, A. Segall, The communication complexity of atomic commitment and gossiping, SIAM J. Comput. 20 (1991) 423-450.