DMTCS 2003: Discrete Mathematics and Theoretical Computer Science pp 193-202 | Cite as
Paths Coloring Algorithms in Mesh Networks
Conference paper
First Online:
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.
Keywords
Polynomial Time Mesh Network Polynomial Time Algorithm Connection Request Horizontal Edge
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.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.Google Scholar
- 2.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).MATHCrossRefMathSciNetGoogle Scholar
- 3.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.Google Scholar
- 4.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.Google Scholar
- 5.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.Google Scholar
- 6.Thomas Erlebach and Klaus Jansen. The complexity of path coloring and call scheduling. Theoret. Comput. Sci., 255(1–2):33–50, 2001.MATHCrossRefMathSciNetGoogle Scholar
- 7.C. Kaklamanis, P. Persiano, T. Erlebach, and K. Jansen. Constrained bipartite edge coloring with application to wavelength routing. In Proc. of ICALP 1997.Google Scholar
- 8.L. Narayanan, J. Opatrny, and D. Sotteau. All-to-all optical routing in optimal chordal networks of degree 4. In Proc. SODA’99. 1998.Google Scholar
- 9.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.Google Scholar
- 10.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.Google Scholar
- 11.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.Google Scholar
- 12.P. Raghavan, E. Upfal. Efficient routing in all-optical networks. In Proc. of STOC 1994.Google Scholar
- 13.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.Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2003