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 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 and an integral demand indicating the number of required lightpaths. 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 the requested number of lightpaths 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. Each accepted call contributes a benefit equal to its demand to the overall profit. The objective in OCA is to maximize the overall profit. Competitive algorithms for OCA have been known for the special case where every call requests just a single lightpath. In this paper we present the first competitive online algorithms for the more general case in which the demand of a call may be as large as |W|.
Research supported by the German Science Foundation (DFG,grant GR 883/10)
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
B. Awerbuch, Y. Azar, A. Fiat,S. Leonardi,and A. Rosén,On-line competitive algorithms for call admission in optical networks, Proceedings of the 4th Annual European Symposium on Algorithms,vol.1136,1996,pp.431–444.
B. Awerbuch, Y. Bartal, A. Fiat,and A. Rosén,Competitive, non-preemptive call control, Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms,1994,pp.312–320.
Y. Bartal, A. Fiat,and S. Leonardi, Lower bounds for on-line graph problems with applications to on-line curcuit and optimal routing, Proceedings of the 28th Annual ACM Symposium on the Theory of Computing,1996,pp.531–540.
A. Borodin and R. El-Yaniv,Online computation and competitive analysis, Cambridge University Press,1998.
J. Kleinberg and E. Tardos, Disjoint paths in densely embedded graphs, Proceedings of the 36th Annual IEEE Symposium on the Foundations of Computer Science, 1995,pp.531–540.
S. Leonardi, A. Marchetti-Spaccamela, A. Presciutti,and A. Rosén, On-line randomized call-control revisited, Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms,1998,pp.323–332.
P. Raghavan and E. Upfal, Efficient routing in all-optical networks, Proceedings of the 26th Annual ACM Symposium on the Theory of Computing,1994,pp.134–143.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krumke, S.O., Poensgen, D. (2002). Online Call Admission in Optical Networks with Larger Demands. In: Goos, G., Hartmanis, J., van Leeuwen, J., Kučera, L. (eds) Graph-Theoretic Concepts in Computer Science. WG 2002. Lecture Notes in Computer Science, vol 2573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36379-3_29
Download citation
DOI: https://doi.org/10.1007/3-540-36379-3_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00331-1
Online ISBN: 978-3-540-36379-8
eBook Packages: Springer Book Archive