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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
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, 1994
Y. Aumann, Y. Rabani. Improved bounds for all-optical routing. In Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, 1995.
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.
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.
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.
R.A. Barry and P.A. Humblet. On the number of wavelengths and switches in all optical networks. IEEE Trans. Comm., 1993.
Y. Bartal and S. Leonardi. On-line routing in all-optical networks. Manuscript, 1996.
J. Kleinberg, E. Tardos. Disjoint paths in densely embedded graphs. In Proceedings of the 36th IEEE Annual Symposium on Foundations of Computer Science, 1995.
R.J. Lipton, A. Tomkins. On-line interval scheduling. In Proceedings of the 5th ACM-Siam Symposium on Discrete Algorithms, 1994.
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.
R.K. Pankay. Architectures for linear light-wave networks. PhD thesis, MIT, 1992.
G.R. Pieris and G.H. Sasaki. A linear lightwave benes network. IEEE/ACM Trans. on Networking, 1993.
Y. Rabani. Path coloring on the mesh. In Proceedings of the 37th IEEE Annual Symposium on Foundations of Computer Science, 1996. To appear.
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.
D. Sleator, R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of ACM 28, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Awerbuch, B., Azar, Y., Fiat, A., Leonardi, S., Rosén, A. (1996). On-line competitive algorithms for call admission in optical networks. In: Diaz, J., Serna, M. (eds) Algorithms — ESA '96. ESA 1996. Lecture Notes in Computer Science, vol 1136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61680-2_73
Download citation
DOI: https://doi.org/10.1007/3-540-61680-2_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61680-1
Online ISBN: 978-3-540-70667-0
eBook Packages: Springer Book Archive