Efficient routing in all-optical networks

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 134-143

  Raghavan, Prabhakar ^a   Upfal, Eli ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FIBER OPTIC NETWORKS; OPTICAL COMMUNICATION; OPTICAL SWITCHES; PHOTONIC DEVICES; ALGORITHMS; CONSTRAINT THEORY; CRITICAL PATH ANALYSIS; FREQUENCY DIVISION MULTIPLEXING; MATHEMATICAL MODELS; OPTICAL LINKS;

ALL- OPTICAL NETWORKS; EFFICIENT ROUTING; HIGH BANDWIDTH; LOGICAL SIGNALS; OPTIC FIBER; ROUTING PARADIGM; SPARSE NETWORK;

NETWORK ROUTING; FIBER OPTIC NETWORKS;

ALL OPTICAL NETWORKS; EFFICIENT ROUTING; PHOTONIC NETWORKS; ROUTING PARADIGMS;

EID: 0028098406     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195119     Document Type: Conference Paper

References (30)

1. A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, and M. Sudan. Efficient routing and scheduling algorithms for optical networks. In Proc. ACM-SIAM SODA., pages 412-423, January 1994.
2. Noga Alon. Eigenvalues and expanders. Com- binatonca, 6(2):83-96, 1986.
3. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. On-line machine scheduling with applications to load balancing and virtual circuit routing. In Proc. 25th Annual ACM Symposium on Theory of Computing, pages 623631, May 1993.
4. B. Awerbuch, Y. Azar, and S. Plotkin. Throughput competitive on-line routing. In Proc. S4th IEEE Annual Symposium on Foundations of Computer Science, November 1993. To appear.
5. B. Awerbuch, Y. Azar, S. Plotkin, and O. Waarts. Competitive routing of virtual circuits with unknown duration. In Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, January 1994. To appear.
6. Y. Azar, B. Kalyanasundaram, S. Plotkin, K. Pruhs, and O. Waarts. On-line load balancing of temporary tasks. In Proc. Workshop on Algorithms and Data Structures, pages 119- 130, August 1993.
7. K. Bala, T.E. Stern, and K. Bala. Algorithms for routing in a linear lightwave network. In Proc. INFOCOM, pages 1-9. IEEE, 1991.
8. R. A. Barry and P. A. Humblet. On the number of wavelengths and switches in all-optical networks. To appear in IEEE Trans. Comm., 1993.
9. R. A. Barry and P. A. Humblet. Bounds on the number of wavelengths needed in WDM networks. In LEOS '92 Summer Topical Mtg. Digest, pages 114-127, 1992.
10. S. Ben-David, A. Borodin, R.M. Karp, G. Tar- dos, and A. Wigderson. On the power of ran-domization in on-line algorithms. In Proc. 22nd Annual ACM Symposium on Theory of Computing, pages 379-388, 1990.
11. C. Berge. The Theory of Graphs and its Applications. John Wiley, 1962.
12. C. Brackett. Dense wavelength division multiplexing networks: Principles and applications. IEEE J. Selected Areas in Comm., 8:373-380, August 1990.
13. A.Z. Broder, A. Frieze, and E. Upfal. Existence and construction of edge disjoint paths on expander graphs. In Proc. 24th ACM STOC, pages 140-149. ACM, 1992.
14. K-W. Cheng. Accousto-optic tunable filters in narrowband WDM networks. IEEE J SAC, 8:1015-1025, 1990.
15. N.K. Cheung, K. Nosu, and G. Winzer. IEEE JSAC: Special issue on dense WDM networks. IEEE JSAC: Special Issue on Dense WDM Networks, 8, 1990.
16. P. E. Green. Fiber-Optic Communication Networks. Prentice Hall, 1992.
17. H.S. Hinton. Architectural considerations for photonic switching networks. IEEE J. Selected Areas in Comm., 6:1209-1226, August 1988.
18. P. Klein, S. Plotkin, C. Stein, and E. Tardos. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. SIAM Journal on Computing, 1992. Accepted for Publication.
19. M. Kovacevic and M. Gerla. Rooted routing in a linear lightwave networks. In Proc. IN-FOCOM, pages 39-48. IEEE, 1992.
20. T. Leighton, F. Makedon, S. Plotkin, C. Stein, S. Tragoudas, and E. Tardos. Fast approximation algorithms for multicommodity flow problem. J. Comp. and Syst. Sci., 1992. Accepted for Publication.
21. A.D. McAulay. Optical Computer Architectures. John Wiley, 1991.
22. R.K. Pankaj. Architectures for linear lightwave networks. PhD thesis, MIT, 1992.
23. S. Personick. Review of fundamentals of optical fiber systems. IEEE J. Selected Areas in Comm., 3:373-380, April 1983.
24. G. R. Pieris and G. H. Sasaki. A linear lightwave Benes network. Submitted to IEEE/ACM Trans, on Networking.
25. G. R. Pieris and G. H. Sasaki. Scheduling transmissions in broadcast and select networks. Unpublished manuscript, 1993.
26. S. Plotkin, D. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. In Proc. 32nd IEEE Annual Symposium on Foundations of Computer Science, pages 495-504, October 1991.
27. R. Ramaswami. Multi-wavelength lightwave networks for computer communication. IEEE Communications Magazine, 31:78-88, 1993.
28. M. Settembre and F. Matera. All optical implementations of high capacity TDMA networks. Fiber and Integrated Optics, 12:173-186, 1993.
29. A. Sinclair and M.R. Jerrum. Approximate counting, uniform generation and rapidly mixing Markov chains. Information and Computation, 82:93-133, 1989.
30. R.J. Vetter and D.H.C. Du. Distributed computing with high-speed optical networks. IEEE Computer, 26:8-18, February 1993.