Abstract
In this paper, we will consider the problem of coloring directed paths on a mesh network. A natural application of this graph problem is WDM-routing in all-optical networks. Our main result is a simple 4-approximation algorithm for coloring line-column paths on a mesh. We also present sharper results when there is a restriction on the path lengths. Moreover, we show that these results can be extended to toroidal meshes and to line-column or column-line paths.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal A, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, and M. Sudan. Efficient routing and scheduling algorithms for optical networks. In Daniel D. Sleator, editor, Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 412–423. ACM Press, 1994.
D. Amar, A. Raspaud, and O. Togni. All-to-all wavelength-routing in all-optical compound networks. Discrete Math., 235(1–3):353–363, 2001. Combinatorics (Prague, 1998).
B. Beauquier, J-C. Bermond, L. Gargano, P. Hell, S. Perennes, and U. Vaccaro. Graphs problems arising from wavelength-routing in all-optical networks. In Proc. WOCS’97, 1997.
T. Erlebach and K. Jansen. Call scheduling in trees, rings and meshes. In HICSS: Hawaii International Conference on System Sciences. IEEE Computer Society Press, 1997.
T. Erlebach and K. Jansen. Scheduling of virtual connections in fast networks. In Proc. of the 4th Workshop on Parallel Systems and Algorithms PASA 96, 1996, pp. 13–32.
Thomas Erlebach and Klaus Jansen. The complexity of path coloring and call scheduling. Theoret. Comput. Sci., 255(1–2):33–50, 2001.
C. Kaklamanis, P. Persiano, T. Erlebach, and K. Jansen. Constrained bipartite edge coloring with application to wavelength routing. In Proc. of ICALP 1997.
L. Narayanan, J. Opatrny, and D. Sotteau. All-to-all optical routing in optimal chordal networks of degree 4. In Proc. SODA’99. 1998.
J. Palaysi. Routage optique et coloration des chemins dans un réseaux torique toutoptique. In Proc. 2me Rencontres Francophones sur les Aspects Algorithmiques des Téléecommunications (Algotel 2000), pages 77–82. INRIA, 2000.
J. Palaysi. Approximability of paths coloring problem in mesh and torus networks. Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probabilities, pages 213–222. Trends in Mathematics. Versailles-Saint-Quentin, France. September 2002.
Yuval Rabani. Path coloring on the mesh. In 37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996), pages 400–409. IEEE Comput. Soc. Press, Los Alamitos, CA, 1996.
P. Raghavan, E. Upfal. Efficient routing in all-optical networks. In Proc. of STOC 1994.
H. Schroeder, O. Sykora, and I. Vrt’o. Optical all-to-all communication for some product graphs. Lecture Notes in Computer Science, 1338:555–562, 1997. In Proc. of SOFSEM’97.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kchikech, M., Togni, O. (2003). Paths Coloring Algorithms in Mesh Networks. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds) Discrete Mathematics and Theoretical Computer Science. DMTCS 2003. Lecture Notes in Computer Science, vol 2731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45066-1_15
Download citation
DOI: https://doi.org/10.1007/3-540-45066-1_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40505-4
Online ISBN: 978-3-540-45066-5
eBook Packages: Springer Book Archive