Advertisement

On-line competitive algorithms for call admission in optical networks

  • Baxuch Awerbuch
  • Yossi Azar
  • Amos Fiat
  • Stefano Leonardi
  • Adi Rosén
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1136)

Abstract

In the present work we study the on-line call admission problem in optical networks. We present a general technique to deal with the problem of call admission and wavelength selection by reducing this problem to the problem of only call admission. We then give randomized algorithms with logarithmic competitive ratios for specific topologies in two models of optical networks, and consider the case of full-duplex communication as well.

Keywords

Directed Path Optical Network Competitive Ratio Competitive Algorithm Wavelength Selection 
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. [ABC+94]
    A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswani, B. Schieber, and M. Sudan. Efficient routing and scheduling algorithms for optical networks. In Proceedings of the 5th Annual ACM-SIAM Symposuim on Discrete Algorithms, pages 412–423, 1994.Google Scholar
  2. [AAP93]
    B. Awerbuch, Y. Azar, and S. Plotkin. Throughput competitive on-line routing. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science, November 1993.Google Scholar
  3. [ABFR94]
    B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosén. Competitive nonpreemptive call control. In Proceedings of 5th AGM-SIAM Symposium on Discrete Algorithms, 1994.Google Scholar
  4. [AGLR94]
    B. Awerbuch, R. Gawlick, F.T. Leighton, and Y. Rabani. On-line admission control and circuit routing for high performance computing and communication. In Proceedings of the 35th IEEE Annual Symposium on Foundations of Computer Science, 1994Google Scholar
  5. [AR94]
    Y. Aumann, Y. Rabani. Improved bounds for all-optical routing. In Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, 1995.Google Scholar
  6. [BBK+90]
    S. Ben-David, A. Borodin, R.M. Karp, G. Tardos, A. Widgerson. On the power of randomization in on-line algorithms. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990.Google Scholar
  7. [BFL96]
    Y. Bartal, A. Fiat, S. Leonardi. Lower bounds for on-line graph problems with application to on-line circuit and optical routing. In Proceedings of the 28th ACM Symposium on Theory of Computing, 1996.Google Scholar
  8. [BH92]
    R.A. Barry and P.A. Humblet. Bounds on the number of wavelengths needed in wdm networks. In LEOS'92 Summer Topical Mtg. Digest, pages 114–127, 1992.Google Scholar
  9. [BH93]
    R.A. Barry and P.A. Humblet. On the number of wavelengths and switches in all optical networks. IEEE Trans. Comm., 1993.Google Scholar
  10. [BL96]
    Y. Bartal and S. Leonardi. On-line routing in all-optical networks. Manuscript, 1996.Google Scholar
  11. [KT95]
    J. Kleinberg, E. Tardos. Disjoint paths in densely embedded graphs. In Proceedings of the 36th IEEE Annual Symposium on Foundations of Computer Science, 1995.Google Scholar
  12. [LT94]
    R.J. Lipton, A. Tomkins. On-line interval scheduling. In Proceedings of the 5th ACM-Siam Symposium on Discrete Algorithms, 1994.Google Scholar
  13. [MKR95]
    M. Mihail, C. Kaklamanis, and S. Rao. Efficient Access to Optical Bandwidth. In Proceedings of the 36th IEEE Annual Symposium on Foundations of Computer Science, pages 548–557, 1995.Google Scholar
  14. [P92]
    R.K. Pankay. Architectures for linear light-wave networks. PhD thesis, MIT, 1992.Google Scholar
  15. [PS93]
    G.R. Pieris and G.H. Sasaki. A linear lightwave benes network. IEEE/ACM Trans. on Networking, 1993.Google Scholar
  16. [R96]
    Y. Rabani. Path coloring on the mesh. In Proceedings of the 37th IEEE Annual Symposium on Foundations of Computer Science, 1996. To appear.Google Scholar
  17. [RU94]
    P. Raghavan and U. Upfal. Efficient routing in all optical networks. In Proceedings of the 26th Annual Symposium on Theory of Computing, pages 133–143, 1994.Google Scholar
  18. [ST85]
    D. Sleator, R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of ACM 28, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Baxuch Awerbuch
    • 1
  • Yossi Azar
    • 2
  • Amos Fiat
    • 2
  • Stefano Leonardi
    • 3
    • 4
  • Adi Rosén
    • 5
  1. 1.MITJohns Hopkins University & Laboratory for Computer ScienceUSA
  2. 2.Department of Computer ScienceTel-Aviv UniversityIsrael
  3. 3.International Computer Science InstituteBerkeley
  4. 4.Dipartimento di Informatica e SistemisticaUniversità di Roma “La Sapienza”Italy
  5. 5.Department of Computer ScienceUniversity of TorontoCanada

Personalised recommendations