On-line competitive algorithms for call admission in optical networks

23Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

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 pjcoblem 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.

Cite

CITATION STYLE

APA

Awerbuch, B., Azar, Y., Fiat, A., Leonardi, S., & Rosén, A. (1996). On-line competitive algorithms for call admission in optical networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1136, pp. 431–444). Springer Verlag. https://doi.org/10.1007/3-540-61680-2_73

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free