Colouring paths in directed symmetric trees with applications to WDM routing

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

Volumn 1256, Issue , 1997, Pages 506-515

  Gargano, Luisa ^a   Hell, Pavol ^b   Perennes, Stephane ^c  

^a UNIVERSITY OF SALERNO   (Italy)

^b SIMON FRASER UNIVERSITY   (Canada)

^c DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COLOR; COMPUTATIONAL COMPLEXITY; DECISION TREES; FORESTRY; OPTICAL COMMUNICATION;

ALL- OPTICAL NETWORKS; ALL-TO-ALL COMMUNICATION; DIRECTED PATHS; DIRECTED TREES; PATHS OF A TREE; TWO PATHS;

TREES (MATHEMATICS);

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

References (30)

1. A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, M. Sudan. “Efficient Routing and Scheduling Algorithms for Optical Networks”, in Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’94), (1994), 412-423.
2. Y. Aumaim and Y. Rabani. “Improved Bounds for All Optical Routing”, Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ‘95), (1995), 567-576.
3. B. Awerblich, Y. Azar, A. Fiat, S. Leonardi, and A. Rosen, “On-Line Competitive Algorithms for Call Admission in Optical Networks”, Proceedings of ESA ‘96, LNCS 1136, (1996), 431-444.
4. R. A. Barry and P. A. Humblet, “On the Number of Wavelengths and Switches in All-Optical Networks”, in IEEE Transactions on Communications, (1993).
5. B. Beauquier. “All-to-AU Communication for some Wavelength-Routing All-Optical Networks”, Manuscript, (1996).
6. B. Beauquier, J-C. Bermond, L. Gargano, P. Hell, S. Pereimes, and U. Vaccaro, “Graph Problems arising from Wavelength-Routing in All-Optical Networks”, 2nd Workshop on Optics and Computer Science (WOCS), April 1997, Geneva, CH.
7. J-C. Bermond, L. Gargano, S. Perennes, A. Rescigno and U. Vaccaro. “Efficient Collective Communications in Optical Networks”, Proc. 23nd ICALP’96, Paderborn, Germany, (1996).
8. D. P. Bertsekas, and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, NJ, 1989.
9. J.A. Bondy and U.S.R. Murty, “Graph Theory and Applications”, American Elsevier, N.Y. 1976.
10. N.K. Cheung, K. Nosu and G. Winzer. IEEE JSAC: Special Issue on Dense WDM Networks, vol. 8 (1990).
11. J. J. Dongarra and D. W. Walker, “Software Libraries for Linear Algebra Computation on High Performances Computers”, SIAM Review, vol. 37, (1995), 151-180.
12. T. Erlebach and K. Jansen. “Scheduling of Virtual Connections in Fast Networks”, Proc. of 4th Workshop on Parallel Systems and Algorithms PASA ‘96, (1996), 13-32.
13. G. Fox, M. Johnsson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker, Solving Problems on Concurrent Processors, Volume 1, Prentice Hall, Englewood Cliffs, NJ, 1988.
14. M. C. Golumbic, “Algorithmic Graph Theory and Perfect Graphs”, Academic Press, N.Y. 1980.
15. M. C. Golumbic and R. E. Jamison, The edge intersection grpahs of paths in a tree, J. Combinatorial Theory B 38 (1985) 8-22.
16. P. E. Green. “The Future of Fiber-Optic Computer Networks”, IEEE Computer, vol. 24, (1991), 78-87.
17. P. E. Green. Fiber-Optic Communication Networks, Prentice-Hall, 1992.
18. C. Kaklamanis and P. Persiano, “Efficient Wavelength Routing on Directed Fiber Trees”, Proc. ESA’96, Springer Verlag, LNCS 1136, (1996), 460-470.
19. C. Kaklamanis and P. Persiano. “Constrained Bipartite Edge Coloring with Applications to Wavelength Routing”, Manuscript (1996).
20. S. M. Hedetniemi, S. T. Hedetniemi, and A. Liestman, “A Survey of Gossiping and Broadcasting in Communication Networks”, NETWORKS, 18 (1988), 129-134.
21. J. Hromkovic, R. Klasing, B. Monien, and R. Peine, “Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping)”, in: Ding-Zhu Du and D. Frank Hsu (Eds.) Combinatorial Network Theory, Kluwer Academic Publishers, 1995, pp. 125-212.
22. A. D. McAulay. Optical Computer Architectures, John Wiley, 1991.
23. M. Mihail, C. Kaklamanis, S. Rao, “Efficient Access to Optical Bandwidth”, Proceedings of 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS’95), (1995), 548-557.
24. A. Pelc, “Fault Tolerant Broadcasting and Gossiping in Communication Networks”, NETWORKS, to appear.
25. R. Ramaswami, “Multi-Wavelength Lightwave Networks for Computer Communication”, IEEE Communication Magazine, vol. 31, (1993), 78-88.
26. Y. Rabani. “Path Coloring on the Meshes”, Proc. of FOCS ‘96.
27. P. Raghavan and E. Upfal. “Efficient Routing in All-Optical Networks”, Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC’94), (1994), 134-143.
28. L. Mirsky, Transversal Theory, Academic Press, New York, London, 1971.
29. R. J. Vetter and D. H. C. Du. “Distributed Computing with High-Speed Optical Networks”, IEEE Computer, vol. 26, (1993), 8-18.
30. O. Wolfson and A. Segall, “The Communication Complexity of Atomic Commitment and Gossiping”, SIAM J. On Computing, 20 (1991), 423-450.