Wavelength assignment problem on all-optical networks with k fibres per link

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

Volumn 1853, Issue , 2000, Pages 768-779

  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; COMBINATORIAL OPTIMIZATION; FORESTRY; POLYNOMIAL APPROXIMATION; ROBOTS; STARS; TOPOLOGY;

ALL- OPTICAL NETWORKS; COMBINATORIAL PROBLEM; COMMUNICATION PATH; MINIMUM NUMBER OF WAVELENGTHS; NATURAL LOWER BOUNDS; NETWORK CONGESTIONS; POLYNOMIAL-TIME ALGORITHMS; WAVELENGTH ASSIGNMENT PROBLEM;

FIBERS;

EID: 84974605117     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_64     Document Type: Conference Paper

References (18)

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), 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. Fibre-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. J. Kleinberg and A. Kumar. Wavelength conversion in optical networks In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms, 1999.
11. L. Lovász. On chromatic number of finite set-systems. Acta Math. Acad. Sci. Hungar, 19:59-67, 1968.
12. A. D. McAulay. Optical Computer Architectures. John Wiley, 1991.
13. J. Petersen. Die Theorie der Regulären Graphen. Acta Math. 15, 193-220, 1891.
14. R. Ramaswami. Multiwavelength lightwave networks for computer communication. IEEE Communications Magazine, 31(2):78-88, Feb. 1993.
15. R. E. Tarjan. Decomposition by clique separators. Discrete Mathematics, 55(2):221-232, 1985.
16. A. Tucker. Coloring a family of circular arcs. SIAM Journal of Applied Mathematics, 29(3):493-502, 1975.
17. R. J. Vetter and D. H. C. Du. Distributed computing with high-speed optical networks. IEEE Computer, 26(2):8-18, Feb. 1993.
18. G. Wilfong and P. Winkler. Ring routing and wavelength translation. In Proc. of the 9th Annual ACM-SIAM Symposium on on Discrete Algorithms (SODA), 333-341, 1998.