Advertisement

Efficient wavelength routing on directed fiber trees

  • Christos Kaklamanis
  • Pino Persiano
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1136)

Abstract

We address the issue of efficiently assigning wavelengths to communication requests in wavelength division multiplexing (WDM) optical networks. We consider directed tree and tree of rings topologies. These are topologies of concrete practical relevance for which undirected underlying graph models have been studied by Raghavan and Upfal [6]. Directed models were first studied by Mihail et al [4].

For trees, we give a polynomial time routing algorithm that, for requests of maximum load L per directed fiber link, uses at most 7/4L wavelengths. This improves the bound of Mihail et al.. As a corollary we also give an algorithm for trees of rings that uses 7/2L wavelengths.

Keywords

Bipartite Graph Optical Network Wavelength Division Multiplex Single Color Fiber Link 
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.
    A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswani, B. Shieber, and M. Sudan, Efficient Routing and Scheduling Algorithms for Optical Networks, in Proc. of SODA 93.Google Scholar
  2. 2.
    J.-C. Bermond, L. Gargano, S. Perennes, A. A. Rescigno, and U. Vaccaro, Efficient Collective Communication in Optical Networks, to appear in Proc. of ICALP 96.Google Scholar
  3. 3.
    P. E. Green, Fiber Optic Communication Networks, Prentice Hall, 1992.Google Scholar
  4. 4.
    M. Mihail, C. Kaklamanis, and S. Rao, Efficient Access to Optical Bandwidth, in Proc. of FOCS 1995.Google Scholar
  5. 5.
    D. Minoli, Telecommunications Technology Handbook, Artech House, 1991.Google Scholar
  6. 6.
    P. Raghavan and E. Upfal, Efficient Routing in All-Optical Networks, in Proc. of STOC 1994.Google Scholar
  7. 7.
    W. Aiello, S. Rajagopalan, R. Venkatesan, Design of practical and Provably Good Random Number Generators, Proc. ACM-SIAM Symposium on Discrete Algorithms SODA 1995, to appear.Google Scholar
  8. 8.
    Alexander, Bondurant, Byrne, Chan, Finn, Gallager, Glance, Haus, Humblet, Jain, Kaminiw, Karol, Kennedy, Kirby, Le, Saleh, Schofield, Shapiro, Shankar, Thomas, Williamson and Milson, A Precompetitive Consortium on Wide-Band All-Optical Networks, IEEE J. of Lightwave Technology, Vol 11 No 5/6, 1993, pp 714–735.Google Scholar
  9. 9.
    C. Berge, Graphs and Hypergraphs, North-Holland Library, 1970.Google Scholar
  10. 10.
    G.K. Chung et al, ONTC-ARPA Technology Development Group, Experimental Demonstration of a Reconfigurable WDM/ATM/SONET Multiwavelength Network Testbed, OFC Optical Fiber Conference, San Jose CA, January 1993.Google Scholar
  11. 11.
    A. Frank, Edge-disjoint Paths in Planar Graphs, JCTB 39, 1985, pp 164–178.Google Scholar
  12. 12.
    M. Garey, D. Johnson, G. Miller, and C. Papadimitriou, The Complexity of Coloring Circular Arcs and Chords, SIAM J. Alg. Disc. Math., Vol 1, No 2, 1980, pp 216–227.Google Scholar
  13. 13.
    M. Goldberg, Edge-Coloring of Multigraphs: Recoloring Technique, Journal of Graph Theory, Vol 8, 1984, pp 123–137.Google Scholar
  14. 14.
    M. Goldberg, An Approximate Algorithm for the Edge-Coloring Problem, Congressus Numerantium, Vol 43, 1984, pp. 317–319.Google Scholar
  15. 15.
    I. Holyer, The NP-Completeness of Edge-Coloring, SIAM J. Comp., Vol 10, No 4 1981, pp 718–720.Google Scholar
  16. 16.
    B. Lennon, High Speed Optical Links between Livermore and Berkeley, Advanced Telecommunications Program of LLNL, ONTC Presentation, Redbank, New Jersey, November 1994.Google Scholar
  17. 17.
    ONTC-ARPA, Brackett, Acampora, Sweitzer, Tangonan, Smith, Lennon, Wang, Hobbs, A Scalable Multiwavelength Multihop Optical Network: A Proposal for Research in All-Optical Networks, IEEE J. of Lightwave Technology, Vol 11 No 5/6, 1993, pp 736–753. OKGoogle Scholar
  18. 18.
    ONTC-ARPA Network Studies Group, Lu, Roorda, Coathup, Gruber, Ashton, Leeson, Boutilier: BNR/Northern Telecom, Bala, Brackett, Cordell, Goldstein, Goodman, Chung, Mihail, Winkler: Bellcore, Acampora, Stern, Zhang, Kovaacevic, Brown, Guo, Jagannath, Jiang: Columbia University, Final Phase I Report, August 1994, pp 25–76.Google Scholar
  19. 19.
    R. Pankaj, Architectures for Linear Lightwave Networks, Ph.D. Thesis, Department of Electrical Engineering and Computer Science, MIT, Cambridge MA, 1992.Google Scholar
  20. 20.
    A. Schrijver, Edge-disjoint Paths in Directed Planar Graphs, SIAM Journal of Algorithms, to appear.Google Scholar
  21. 21.
    A. Tucker, Coloring a Family of Circular Arcs, SIAM J. Appl. Math. Vol 29, No 3, 1975, pp 493–502.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Christos Kaklamanis
    • 1
  • Pino Persiano
    • 2
  1. 1.Computer Technology InstituteUniversity of PatrasRioGreece
  2. 2.Dipartimento di Informatica ed Appl.Università di SalernoBaronissiItaly

Personalised recommendations