Abstract
In the problem of Online Call Admission in Optical Networks, briefly called oca, we are given a graph G=(V,E) together with a set of wavelengths W (χ:=|W|) and a finite sequence σ=r 1,r 2,... of calls which arrive in an online fashion. Each call r j specifies a pair of nodes to be connected. A lightpath is a path in G together with a wavelength λ ∈ W.
Upon arrival of a call, an online algorithm must decide immediately and irrevocably whether to accept or to reject the call without any knowledge of calls which appear later in the sequence. If the call is accepted, the algorithm must provide a lightpath to connect the specified nodes. The essential restriction is the wavelength conflict constraint: each wavelength is available only once per edge, which implies that two lightpaths sharing an edge must have different wavelengths. The objective in oca is to maximize the overall profit, that is, the number of accepted calls.
A result by Awerbuch et al. states that a c-competitive algorithm for oca with one wavelength, i.e., χ:=|W|=1, implies a (c+1)-competitive algorithm for general numbers of wavelengths. However, for instance, for the line with n+1 nodes, a lower bound of n for the competitive ratio of deterministic algorithms for χ=1 makes this result void in many cases. We provide a deterministic competitive algorithm for χ> 1 wavelengths which achieves a competitive ratio of \(\chi(\sqrt[\chi]{n} + 2)\) on the line with n+1 nodes. As long as χ> 1 is fixed, this is the first competitive ratio which is sublinear in n+1, the number of nodes.
Supported by the Priority Programme “Mathematik und Praxis” at the University of Kaiserslautern.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adler, R., Azar, Y.: Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1–10 (1999)
Awerbuch, B., Azar, Y., Fiat, A., Leonardi, S., Rosén, A.: On-line competitive algorithms for call admission in optical networks. In: Díaz, J. (ed.) ESA 1996. LNCS, vol. 1136, pp. 431–444. Springer, Heidelberg (1996)
Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive online routing. In: Proceedings of the 34th Annual IEEE Symposium on the Foundations of Computer Science, pp. 32–40 (1993)
Awerbuch, B., Gawlick, R., Leighton, F.T., Rabani, R.: On-line admission control and curcuit routing for high performance computing and communication. In: Proceedings of the 35th Annual IEEE Symposium on the Foundations of Computer Science, pp. 412–423 (1994)
Awerbuch, B., Bartal, Y., Fiat, A., Rosén, A.: Competitive, non-preemptive call control. In: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 312–320 (1994)
Bar-Noy, A., Canetti, R., Kutten, S., Mansour, Y., Schieber, B.: Bandwidth allocation with preemption. In: Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, pp. 616–625 (1995)
Bartal, Y., Fiat, A., Leonardi, S.: Lower bounds for on-line graph problems with applications to on-line curcuit and optimal routing. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, pp. 531–540 (1996)
Garay, J.A., Gopal, I.S.: Call preemption in communication networks. In: Proceedings of INFOCOM 1992, pp. 1043–1050 (1992)
Garay, J.A., Gopal, I.S., Kutten, S., Mansour, Y., Yung, M.: Efficient on-line call control algorithms. Journal of Algorithms 23(1), 180–194 (1997)
Kleinberg, J., Rubenfield, R.: Short paths in expander networks. In: Proceedings of the 37th Annual IEEE Symposium on the Foundations of Computer Science, pp. 86–95 (1996)
Kleinberg, J., Tardos, E.: Disjoint paths in densely embedded graphs. In: Proceedings of the 36th Annual IEEE Symposium on the Foundations of Computer Science, pp. 531–540 (1995)
Krumke, S.O., Poensgen, D.: Online call admission in optical networks with larger wavelength demands. In: Kučera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 333–344. Springer, Heidelberg (2002)
Leonardi, S., Marchetti-Spaccamela, A., Presciutti, A., Rosèn, A.: On-line randomized call-control revisited. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 323–332 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gassner, E., Krumke, S.O. (2006). Deterministic Online Optical Call Admission Revisited. In: Erlebach, T., Persinao, G. (eds) Approximation and Online Algorithms. WAOA 2005. Lecture Notes in Computer Science, vol 3879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11671411_15
Download citation
DOI: https://doi.org/10.1007/11671411_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32207-8
Online ISBN: 978-3-540-32208-5
eBook Packages: Computer ScienceComputer Science (R0)