Decidable properties of graphs of all-optical networks

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

Volumn 2076 LNCS, Issue , 2001, Pages 518-529

  Margara, Luciano ^a   Simon, Janos ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; FIBER OPTIC NETWORKS; COMPUTATIONAL LINGUISTICS; TELECOMMUNICATION NETWORKS;

ALL- OPTICAL NETWORKS; BUILDING BLOCKES; DECIDABILITY QUESTIONS; DECOMPOSITION THEORY; FIXED GRAPHS; PARALLEL FIBERS;

GRAPH THEORY;

EID: 84879535758     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_43     Document Type: Conference Paper

References (23)

1. R. P. Anstee. An algorithmic proof of Tutte's f-factor theorem. Journal of Algorithms, 6:112-131, 1985.
2. B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Perennes, and U. Vaccaro. Graph problems arising from wavelength-routing in all-optical networks. Proc. of Workshop on Optics in Computer Science WOCS'97.
3. N. K. Cheung, N. K. , and G. Winzer. Special issue on dense WDM networks. Journal on Selected Areas in Communications, 8, 1990.
4. T. Erlebach and K. Jansen. Scheduling of virtual connections in fast networks. In Proc. of Parallel Systems and Algorithms (PASA), pages 13-32, 1996.
5. T. Erlebach and K. Jansen. Call scheduling in trees, rings and meshes. In Proc. of HICSS, 1997.
6. M. C. Golumbic and R. E. Jamison. The edge intersection graphs of paths in a tree. Journal of Combinatorial Theory, Series B, 38:8-22, 1985.
7. P. E. Green. Fiber-optic communication networks. Prentice-Hall, 1993.
8. I. Holyer. The NP-completeness of edge coloring. SIAM Journal of Computing, 10(4):718-720, 1981.
9. C. Kaklamanis, G. Persiano, T. Erlebach,and K. Jansen. Constrained bipartite edge coloring with applications to wavelength routing. Proc. of ICALP'97, Lecture notes in Computer Science vol. 1256:493-504, 1997.
10. R. Klasing. Methods and problems of wavelength-routing in all-optical networks. In Proc. of the MFCS'98 Workshop on Communication, 1998.
11. J. Kleinberg and A. Kumar. Wavelength conversion in optical networks In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms, 1999.
12. G. Li and R. Simha On the wavelength assignment problem in multifiber WDM star and ring networks In Proc. IEEE INFOCOM, 2000.
13. L. Lov́asz. On chromatic number of finite set-systems. Acta Math. Acad. Sci. Hungar, 19:59-67, 1968.
14. A. D. McAulay. Optical computer architectures. John Wiley, 1991.
15. L. Margara and J. Simon Wavelength assignment problem on all-optical networks with k fibers per link Proc. of ICALP2000, Lecture notes in Computer Science vol. 1853:768-779, 2000.
16. M. Mihail, C. Kaklamanis, and S. Rao. Efficient access to optical bandwidth-wavelength routing on directed fiber trees, rings, and trees of rings. In Proc. of 36th IEEE-FOCS, pp. 548-557, 1995.
17. R. K. Pankaj and R. G. Gallager. Wavelength requirements of all-optical networks. IEEE/ACM Trans. on Networking, 3:269-280, 1995.
18. J. Petersen. Die Theorie der Regul̈aren Graphen. Acta Math. 15, 193-220, 1891.
19. R. Ramaswami. Multiwavelength lightwave networks for computer communication. IEEE Communications Magazine, 31(2):78-88, Feb. 1993.
20. R. E. Tarjan. Decomposition by clique separators. Discrete Mathematics, 55(2):221-232, 1985.
21. A. Tucker. Coloring a family of circular arcs. SIAM Journal of Applied Mathematics, 29(3):493-502, 1975.
22. R. J. Vetter and D. H. C. Du. Distributed computing with high-speed optical networks. IEEE Computer, 26(2):8-18, Feb. 1993.
23. G. Wilfong and P. Winkler. Ring routing and wavelength translation. In Proc. of the 9th Annual ACM-SIAM Symposium on on Discrete Algorithms (SODA), pp. 333-341, 1998.