On-line routing in all-optical networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 516-526

  Bartal, Yair ^a   Leonardi, Stefano ^b  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FIBER OPTIC NETWORKS; FORESTRY; NETWORK ROUTING; TOPOLOGY; TREES (MATHEMATICS);

ADDITIONAL COSTS; ALL- OPTICAL NETWORKS; ARBITRARY NETWORKS; COMPETITIVE RATIO; NETWORK ECONOMICS; ON-LINE ALGORITHMS; SINGLE WAVELENGTH; SPACE DIVISION MULTIPLEXING;

SPACE DIVISION MULTIPLE ACCESS;

EID: 84951145642     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_207     Document Type: Conference Paper

References (23)

1. A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, and M. Sudan. Efficient Routing and Scheduling Algorithms for Optical Networks. Proc. of SODA ‘94, pp. 412-423.
2. J. Aspens, Y. Azar, A. Fiat, S. Plotkin and O. Waarts. On-line Load Balancing with Applications to Machine Scheduling and Virtual Circuit Routing. Proc. of STOC’93.
3. B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi, A. Rosen. On-line Competitive Algorithms for Call Admission in Optical Networks. Proc. of ESA ‘96, LNCS 1136, pp. 431-444.
4. B. Awerbuch, Y. Azar, and S. Plotkin. Throughput Competitive On-line Routing. Proc. of FOCS’93.
5. B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosén. Competitive Non-Preemptive Call Control. Proc. of SODA ‘91
6. B. Awerbuch, R. Gawlick, F.T. Leighton, and Y. Rabani. On-line Admission Control and Circuit Routing for High Performance Computing and Communication. Proc. of FOGS ‘94.
7. Y. Àumann, Y. Rabani. Improved Bounds for All-Optical Routing. Proc. of SODA’95.
8. Y. Bartal, A. Fiat, S. Leonardi. Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. Proc. of STOC’96.
9. A. Borodin, J. Kleinberg, and M. Sudan. Personal communication.
10. Y. Bartal and S. Leonardi. On-line Routing in All-Optical Networks. Tech Rep 02-97, Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, 1997.
11. P.E. Green. Fiber-Optic Communication Networks. Prentice Hall, 1992.
12. T. Erlebach, K. Jansen, C. Kaklamanis and P. Persiano. Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. Proc. of ICALP ‘97 (this proceedings).
13. O. Gerstel and S. Kutten. Dynamic Wavelength Allocation in WDM Ring Networks. To appear in Proceedings of ICC ‘97.
14. S. Irani. Coloring inductive graphs on-line. Proc of FOCS’90, pp. 470-479.
15. C. Kaklamanis and P. Persiano. Efficient wavelength routing in directed fiber trees. Proc. of ESA’96, LNCS 1136, pp. 460-470.
16. V. Kumar and E. Schwabe. Improved Access to Optical Bandwidth in Trees. Proc. of SODA’97.
17. HA. Kierstead and W.T. Trotter. An Extremal Problem in Recursive Combinatorics. Congress. Numer., 33, pp. 143-153, 1981.
18. J. Kleinberg and E. Tardos. Disjoint Paths in Densely Embedded Graphs. Proc. Of FOCS’95, pp. 52-61.
19. M. Mihail, C. Kaklamanis, and S. Rao. Efficient Access to Optical Bandwidth. Proc. ofFOCS’95, pp. 548-557.
20. Y. Rabani. Path-Coloring on the Mesh. Proc. of FOCS’96, pp. 400-409.
21. P. Raghavan and U. Upfal. Efficient Routing in All-Optical Networks. Proc. of STOC’94, pp. 133-143.
22. M. Ślusarek. Optimal Online Coloring of Circular Arc Graphs. Informatiquc Theoretique et Applications, vol. 29, n. 5, pp. 423-429.
23. D. Sleator, R.E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communications of ACM 28, 1985.