Efficient wavelength routing on directed fiber trees

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

Volumn 1136, Issue , 1996, Pages 460-470

  Kaklamanis, Christos ^a   Persiano, Pino ^b  

^a UNIVERSITY OF PATRAS   (Greece)

^b UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION TREES; FORESTRY; OPTICAL COMMUNICATION; POLYNOMIAL APPROXIMATION; TOPOLOGY; WAVELENGTH DIVISION MULTIPLEXING;

DIRECTED TREES; FIBER LINKS; MAXIMUM LOAD; POLYNOMIAL-TIME; TREE OF RINGS; UNDERLYING GRAPHS; WAVELENGTH ROUTING;

TREES (MATHEMATICS);

EID: 84937432064     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61680-2_75     Document Type: Conference Paper

References (21)

1. A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswani, B. Shieber, and M. Sudan, Efficient Routing and Scheduling Algorithms for Optical Networks, in Proc. of SODA 93.
2. J.-C. Bermond, L. Gargano, S. Perermes, A. A. Rescigno, and U. Vaccaro, Efficient Collective Communication in Optical Networks, to appear in Proc. of ICALP 96.
3. P. E. Green, Fiber Optic Communication Networks, Prentice Hall, 1992.
4. M. Mihail, C. Kaldamanis, and S. Rao, Efficient Access to Optical Bandwidth, in Proc. of FOCS 1995.
5. D. Minoli, Telecommunications Technology Handbook, Artech House, 1991.
6. P. Raghavan and E. Upfal, Efficient Routing in All-Optical Networks, in Proc. of STOC 1994.
7. W. Aiello, S. Rajagopalan, R. Venkatesan, Design of practical and Provably Good Random Number Generators, Proc. ACM-SIAM Symposium on Discrete Algorithms SODA 1995, to appear.
8. Alexander, Bondurant, Byrne, Chan, Finn, Gallager, Glance, Hans, Humbler, Jain, Kaminiw, Karol, Kennedy, Kirby, Le, Saleh, Schofield, Shapiro, Shankar, Thomas, Williamson and Milson, A Precompetitive Consortium on Wide-Band All-Optical Networks, IEEE J. of Lightwave Technology, Vol 11 No 5/6, 1993, pp 714-735.
9. C. Berge, Graphs and Hypergraphs, North-Holland Library, 1970.
10. G.K. Chung et al, ONTC-ARPA Technology Development Group, Experimental Demonstration of a Reconfigurable WDM/ATM/SONET Multiwavelength Network Testbed, OFC Optical Fiber Conference, San Jose CA, January 1993.
11. A. Frank, Edge-disjoint Paths in Planar Graphs, JCTB 39, 1985, pp 164-178.
12. M. Garey, D. Johnson, G. Miller, and C. Papadimitriou, The Complexity of Coloring Circular Arcs and Chords, SIAM J. Alg. Disc. Math., Vol 1, No 2, 1980, pp 216-227.
13. M. Goldberg, Edge-Coloring of Multigraphs: Recoloring Technique, Journal of Graph Theory, Vol 8, 1984, pp 123-137.
14. M. Goldberg, An Approximate Algorithm for the Edge-Coloring Problem, Congressus Numerantium, Vol 43, 1984, pp. 317-319.
15. I. Holyer, The NP-Completeness of Edge-Coloring, SIAM J. Comp., Vol 10, No 4, 1981, pp 718-720.
16. B. Lennon, High Speed Optical Links between Livermore and Berkeley, Advanced Telecommunications Program of LLNL, ONTC Presentation, Redbank, New Jersey, November 1994.
17. ONTC-ARPA, Brackett, Acampora, Sweitzer, Tangonan, Smith, Lennon, Wang, Hobbs, A Scalable Multiwavelength Multihop Optical Network: A Proposal for Research in All-Optical Networks, IEEE J. of Lightwave Technology, Vol 11 No 5/6, 1993, pp 736-753. OK
18. ONTC-ARPA Network Studies Group, Lu, Roorda, Coathup, Gruber, Ashton, Leeson, Boutilier: BNR/Northeru Telecom, Bala, Brackett, Cordell, Goldstein, Goodman, Chung, Mihail, Winlder: Bencore, Acampora, Stern, Zhang, Kovaacevic, Brown, Guo, Jagannath, Jiang: Columbia University, Final Phase I Report, August 1994, pp 25-76.
19. R. Pankaj, Architectures for Linear Lightwave Networks, Ph.D. Thesis, Department of Electrical Engineering and Computer Science, MIT, Cambridge MA, 1992.
20. A. Schrijver, Edge-disjoint Paths in Directed Planar Graphs, SIAM Journal of Algorithms, to appear.
21. A. Tucker, Coloring a Family of Circular Arcs, SIAM J. Appl. Math. Vol 29, No 3, 1975, pp 493-502