Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1999: Foundations of Software Technology and Theoretical Computer Science pp 201–213Cite as

Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1738))

Abstract

We study the problem of routing and scheduling requests of limited durations in an all-optical network. The task is servicing the requests, assigning each of them a starting time and a wavelength, with restrictions on the number of available wavelengths. The goal is minimizing the overall time needed to serve all requests. We propose constant approximation algorithms for both ring and chain networks. In doing this, we also propose a polynomial-time approximation scheme for the problem of routing weighted calls on a directed ring with minimum load.

This work was partially supported by ESPRIT project ALCOM-IT and by the START program Y43-MAT of the Austrian Ministry of Science.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network flows. Prentice-Hall, 1993. 208

    Google Scholar 

  2. B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi, and A. Rosen. On-line competitive algorithms for call admission in optical networks. In Proc. of the 4th Annual European Symposium on Algorithms, 1996. 202

    Google Scholar 

  3. Y. Bartal, A. Fiat, and S. Leonardi. Lower bounds for on-line graph problems with application to on-line circuit and optical-routing. In Proc. of the 28th Annual Symposium on the Theory of Computing, 1996. 202, 202

    Google Scholar 

  4. Y. Bartal and S. Leonardi. On-line routing in all-optical networks. In Proc. of the 24th International Colloquium on Automata, Languages and Programming, 1997. 202

    Google Scholar 

  5. L. Becchetti. Efficient Resource Management in High Bandwidth Networks. PhD thesis, Dipartimento di Informatica e Sistemistica, University of Rome “La Sapienza”, 1998. 203

    Google Scholar 

  6. C. Brackett. Dense Wavelength Division Multiplexing Networks: Principles and Applications. IEEE Journal Selected Areas in Comm., 8, 1990. 201

    Google Scholar 

  7. T. Erlebach and K. Jansen. Scheduling Virtual Connections in Fast Networks. In Proc. of the 4th Parallel Systems and Algorithms Workshop PASA’ 96, 1996. 202

    Google Scholar 

  8. T. Erlebach and K. Jansen. Call Scheduling in Trees, Rings and Meshes. In Proc. of the 30th Hawaii International Conference on System Sciences, 1997. 202

    Google Scholar 

  9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, 1979. 204

    MATH  Google Scholar 

  10. J. Gergov. Approximation algorithms for dynamic storage allocation. In Proc. of the 4th Annual European Symposium on Algorithms, 1996. 204, 205, 205, 207

    Google Scholar 

  11. J. Gergov. Algorithms for Compile-Time Memory Optimization. Private communication, 1998. 202, 204, 204

    Google Scholar 

  12. R. L. Graham. Bounds for multiprocessing timing anomalies. SIAM Journal of Applied Math., 17, 1969. 206

    Google Scholar 

  13. P. E. Green. Fiber-optic Communication Networks. Prentice-Hall, 1992. 201, 201, 201

    Google Scholar 

  14. S. Khanna. A Polynomial Time Approximation Scheme for the SONET Ring Loading Problem. Bell Labs Tech. J., Spring, 1997. 202, 203, 208, 211, 212

    Google Scholar 

  15. H. A. Kierstead and W. T. Trotter. An extremal problem in recursive combinatorics. Congressus Numerantium, 33, 1981. 202

    Google Scholar 

  16. T. Leighton, B. Maggs, and S. Rao. Packet routing and jobshop scheduling in O(congestion+dilation) steps. Combinatorica, 14, 1994. 202

    Google Scholar 

  17. P. Raghavan and E. Upfal. Efficient Routing in All-Optical Networks. In Proc. of the 26th Annual Symposium on the Theory of Computing, 1994. 201, 202

    Google Scholar 

  18. A. Schrijver, P. Seymour, and P. Winkler. The Ring Loading Problem. SIAM J. on Discrete Math., 11, 1998. 202, 202, 202, 203, 212

    Google Scholar 

  19. G. Wilfong and P. Winkler. Ring Routing and Wavelength Translation. In Proc. of the European Symposium on Algorithms, pages 333–341, 1998. 202, 203, 208, 209, 209, 212

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik B, Technische Universität Graz, Austria

    Luca Becchetti

  2. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Italy

    Alberto Marchetti-Spaccamela

  3. Dipartimento di Ingegneria Elettronica e dell’Informazione, Università di Perugia, Italy

    Miriam Di Ianni

Authors
  1. Luca Becchetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miriam Di Ianni
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alberto Marchetti-Spaccamela
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Chennai, 600036, India

    C. Pandu Rangan

  2. Institute of Mathematical Sciences C.I.T. Campus, Chennai, 600113, India

    V. Raman  & R. Ramanujam  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Becchetti, L., Di Ianni, M., Marchetti-Spaccamela, A. (1999). Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings. In: Rangan, C.P., Raman, V., Ramanujam, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1999. Lecture Notes in Computer Science, vol 1738. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46691-6_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-46691-6_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66836-7

  • Online ISBN: 978-3-540-46691-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation