Wide-sense nonblocking WDM cross-connects

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

Volumn 2461, Issue , 2002, Pages 538-550

  Haxell, Penny ^a   Rasala, April ^b   Wilfong, Gordon ^c   Winkler, Peter ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

CROSS CONNECTS; EDGE COLORING; EXPONENTIAL BOUNDS; GRAPH-THEORETIC PROBLEM; MINIMIZING THE NUMBER OF; OUTPUT FIBERS; WAVELENGTH DIVISION MULTIPLEXED OPTICAL NETWORKS; WIDE SENSE NONBLOCKING;

CROSS CONNECTIONS (WATER DISTRIBUTION);

EID: 77649329277     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_48     Document Type: Conference Paper

References (23)

1. A. Bar-Noy, R. Motwani, and J. Naor. The greedy algorithm is optimal for on-line edge coloring. Information Processing Letters, 44(5):251-253, 1992. 543
2. L. A. Bassalygo and M. S. Pinsker. Complexity of an optimal nonblocking switching network without reconnections. Problems Inform. Transmission, 9:64-66, 1974. 541
3. L. A. Bassalygo and M. S. Pinsker. Asymptotically optimal networks for generalized rearrangeable switching and generalized switching without rearrangement. Problemy Peredachi Informatsii, 16:94-98, 1980. 541
4. C. Berge. Graphs and Hypergraphs. North Holland, Amsterdam, 1973. 543
5. L. Cai and J. A. Ellis. NP-completeness of edge-coloring some restricted graphs. Discrete Appl. Math., 30:15-27, 1991. 543
6. I. Caragiannis, C. Kaklamanis, and P. Persiano. Edge coloring of bipartite graphs with constraints. Theoretical Computer Science, 270(1-2):361-399, 2002. 543
7. T. Erlebach, K. Jansen, C. Kaklamanis, M. Mihail, and P. Persiano. Optimal wavelength routing on directed fiber trees. Theoretical Computer Science, 221(1-2):119-137, 1999. 539, 543
8. L. Favrholdt and M. Nielsen. On-line edge coloring with a fixed number of colors. In Foundations of Software Technology and Theoretical Computer Science, pages 106-116, Dec. 2000. 543
9. P. Feldman, J. Friedman, and N. Pippenger. Wide-sense nonblocking networks. SIAM J. Disc. Math., 1(2):158-173, 1988. 541
10. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco, CA, 1979. 543
11. I. Holyer. The NP-completeness of edge-coloring. SIAM Journal of Computing, 10:718-720, 1981. 543
12. T. R. Jensen and B. Toft. Graph Colouring Problems. Wiley, New York, 1995. 543
13. C. Kaklamanis and P. Persiano. Efficient wavelength routing on directed fiber trees. In Proceedings of the Ąth European Symposium on Algorithms (ESA ‘96), pages 460-470, 1996. 539, 543
14. C. Kaklamanis, P. Persiano, T. Erlebach, and K. Jansen. Constrained bipartite edge coloring with applications to wavelength routing. In Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP ‘97), pages 493-504, 1997. 539, 543
15. D. Konig. Graphok es alkalmazasuk a determinansok es a halmazok elmeletere (in Hungarian). Mathematikai es Termeszettudomanyi Ertesitö, 34:104-119, 1916. 543
16. V. Kumar and E. J. Schwabe. Improved access to optical bandwidth. In Proceedings of 8th ACM-SIAM Symposium on Discrete Algorithms(SODA ‘97), pages 437-444, 1997. 539, 543
17. M. Mihail, C. Kaklamanis, and S. Rao. Efficient access to optical bandwidth. In Proceedings of the 36th Annual IEEE Symposium on the Foundations of Computer Science (FOCS ‘95), pages 548-557, 1995. 539, 543
18. R. Ramaswami and G. H. Sasaki. Multiwavelength optical networks with limited wavelength conversion. In Proceedings of IEEE INFOCOM, volume 2, pages 489-498, 1997. 548
19. A. Rasala and G. Wilfong. Strictly non-blocking WDMcross-connects. In Proceedings of Symposium on Discrete Algorithms (SODA ‘00), pages 606-615, 2000. 540, 541
20. A. Rasala and G. Wilfong. Strictly non-blocking WDMcross-connects for het-erogreous networks. In Proceedings of Symoposium on Theory of Computation (STOC 00), 2000. 540
21. C. E. Shannon. Memory requirements in a telephone exchange. Bell System Tech. J., 29:343-349, 1950. 540
22. V. G. Vizing. On an estimate of the chromatic class of a p-graph (in Russian). Diskret. Analiz, 3:23-30, 1964. 543
23. G. Wilfong, B. Mikkelsen, C. Doerr, and M. Zirngibl. WDM cross-connect architectures with reduced complexity. Journal of Lightwave Technology, pages 1732-1741, October 1999. 539, 541