Wavelength routing of uniform instances in all-optical rings

Discrete Optimization - Tập 2 - Trang 335-347 - 2005
Lata Narayanan1, Jaroslav Opatrny1
1Department of Computer Science and Software Engineering, Concordia University, Montreal, Que., H3G 1M8 Canada

Tài liệu tham khảo

Aggarwal, 1996, Efficient routing in optical networks, JACM, 46, 973, 10.1145/235809.235812 Beauquier, 1997, Graph problems arising from wavelength-routing in all-optical networks Bracket, 1990, Dense wavelength division multiplexing networks: principles and applications, IEEE J. Selected Areas Commun., 8, 948, 10.1109/49.57798 Cheung, 1990, An introduction to the special issue on dense WDM networks, IEEE J. Selected Areas Commun., 8, 945 F. Comellas, M. Mitjana, L. Narayanan, J. Opatrny, Wavelength routing of uniform instances in tori, Proceedings of Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 1893, Springer, Berlin, 2000, pp. 285–294. Erlach, 1996, Scheduling of virtual connections in fast networks, 13 Fabrega, 1997, Fault tolerant routings in double fixed-step networks, Discrete Appl. Math., 78, 61, 10.1016/S0166-218X(97)00015-2 M. Fiol, J. Yebra, M. Fiol, Grafos y teselaciones del plano, Actas III JAEM, Spain, 1983, pp. 69–77. Mihail, 1995, Efficient access to optical bandwidth, 548 Narayanan, 1999, Compact routing in chordal rings of degree four, Algorithmica, 23, 76, 10.1007/PL00009251 Narayanan, 2000, Wavelength routing of uniform instances in all-optical rings, 203 Narayanan, 1999, All-to-all optical routing in chordal rings of degree four, 695 J. Opatrny, Uniform multi-hop all-to-all optical routings in rings, Theor. Comput. Sci. 297 (1–3) (2003) 385–397. Tucker, 1975, Coloring a family of circular arcs, SIAM J. Appl. Math., 29, 493, 10.1137/0129040 Wong, 1974, A combinatorial problem related to multimode memory organizations, JACM, 21, 392, 10.1145/321832.321838