Advertisement

Approximability of Paths Coloring Problem in Mesh and Torus Networks

  • Jérôme Palaysi
Conference paper
Part of the Trends in Mathematics book series (TM)

Abstract

In optical networks, the use of bandwidth can be optimized by a technique called “Wavelength Division Multiplexing” (WDM). In these networks, the data undergo some optical-electronic conversions which make them slow down. To solve this problem, the path was computed and set up before the data transmission: these networks are refered as all-optical networks. Signals can be transmitted through a same fiber link at the same time only if they have different wavelengths. We deal with particular networks families: meshes and toroidal meshes. Let a set of paths assigned to a set of connection requests. We try to find a feasible assignment of wavelengths (called “colors” in our model) to the paths. The goal is to minimize the number of wavelengths used.

We show the existence of approximation algorithms for paths computed by a linecolumn routing, while the problem is shown to be no-APX when paths are computed by a free-routing, a shortest-path routing or a minimal load routing.

Keywords

Short Path Optical Network Wavelength Division Multiplex Connection Request Coloring Problem 
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.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Bruno Beauquier, Jean-Claude Bermond, Luisa Gargano, Pavol Hell, Stéphane Pérennes and Ugo Vaccaro. Graph problems arising from wavelength-routing in all-optical networks research report, I.N.R.I.A., France, May 1997.Google Scholar
  2. [2]
    Bruno Beauquier Communication dans les réseaux optiques par multiplexage en longueur d’onde PdD dissertation, University Nice-Sophia Antipolis, France, January 2000.Google Scholar
  3. [3]
    Claude Berge. Graphes et Hypergraphes theorem 12, page 238. Monographies Universitaires de Mathématiques. Dunod, Paris, France, 1970.Google Scholar
  4. [4]
    Thierry Chich. Optimisation du routage par déflexion dans les réseaux de télécommunications métropolitains. PhD dissertation, École Normale Supérieure de Lyon, France, December 1997.Google Scholar
  5. [5]
    Reinhard Diestel. Graph Theory Graduate Texts in Mathematics, Springer, 1997.zbMATHGoogle Scholar
  6. [6]
    Thomas Erlebach and Kaus Jansen. Call-scheduling in trees rings and meshes . In IEEE Computer Society Press, editor, Proceedings of the 30th Hawaii International Conference on System Sciences (HICSS-30), number 1, pages 221–222, 1997.Google Scholar
  7. [7]
    Thomas Erlebach. Scheduling Connections in Fast Networks. PhD dissertation, Technical University of Munich, Germany, 1999.Google Scholar
  8. [8]
    Fhnicá Gavril. Algorithms for minimum coloring maximum clique minimum covering by cliques and maximum independent set of a chordal graph. SIAM Journal on Computing, 1:180–187, 1972.MathSciNetzbMATHCrossRefGoogle Scholar
  9. [9]
    Dorit S. Hochbaum. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1997.Google Scholar
  10. [10]
    Jérôme Palaysi Routage tout-optique et coloration de chanes dans les réseaux en grilles et les réseaux toriques. research report 00128, L.I.R.M.M., Montpellier, France, October 2000.Google Scholar
  11. [11]
    Heiko Schröder, Ondrej Sykora and Imrich Vrt’o. Optical all-to-all communication for some product graphs. In proceeding of the 24th Seminar on Current Trends in Theory and Practice of Informatics (SOF-SEM),1997.Google Scholar
  12. [12]
    ] Alan Tucker Coloring a family of circular arcs. SIAM Journal Appl. Math., 29(3):493–502, november 1975.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer Basel AG 2002

Authors and Affiliations

  • Jérôme Palaysi
    • 1
  1. 1.Laboratoire InformatiqueRobotique Microélectronique MontpellierFrance

Personalised recommendations