Abstract
Given a network together with a set of connection requests, call admission control is the problem of deciding which calls to accept and which ones to reject in order to maximize the total profit of the accepted requests. We consider call admission control problems with advance reservations in star networks. For the most general variant we present a constant-factor approximation algorithm resolving an open problem due to Erlebach. Our method is randomized and achieves an approximation ratio of 1/18. It can be generalized to accommodate call alternatives, in which case the approximation ratio is 1/24. We show how our method can be derandomized. In addition we prove that call admission control in star networks is \({\mathcal APX}\)-hard even for very restricted variants of the problem.
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
Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. Wiley, New York (1992)
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties. Springer, Berlin (1999)
Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J.S., Schieber, B.: A unified approach to approximating resource allocation and scheduling. Journal of the ACM (JACM) 48(5), 1069–1090 (2001)
Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 25, 27–46 (1985)
Berman, P., DasGupta, B., Muthukrishnan, S., Ramaswami, S.: Improved approximation algorithms for rectangle tiling and packing. In: Proceedings of the 12th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA), pp. 427–436 (2001)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Chakrabarti, A., Chekuri, C., Gupta, A., Kumar, A.: Approximation algorithms for the unsplittable flow problem. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 51–66. Springer, Heidelberg (2002)
Chekuri, C., Mydlarz, M., Shepherd, F.B.: Multicommodity demand flow in a tree. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 410–425. Springer, Heidelberg (2003)
Duffield, N.G., Goyal, P., Greenberg, A., Mishra, P., Ramakrishnan, K.K., van der Merwe, J.E.: Resource management with hoses: point-to-cloud services for virtual private networks. IEEE/ACM Transactions on Networking (TON) 10(5), 679–692 (2002)
Edmonds, J.: Paths, trees and flowers. Canadian Journal of Mathematics 17, 449–467 (1965)
T. Erlebach. Call admission control for advance reservation requests with alternatives. In Proceedings of the 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), Proceedings in Informatics, pages 51–64. Carleton Scientific, 2002.
Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
Guérin, R.A., Orda, A.: Networks with advance reservations: The routing perspective. In: Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 118–127. IEEE Computer Society Press, Los Alamitos (2000)
Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), pp. 19–28 (1999)
Kann, V.: Maximum bounded 3-dimensional matching is MAX SNP-complete. Information Processing Letters 37, 27–35 (1991)
Kleinberg, J.: Approximation algorithms for disjoint paths problems. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (1996)
Leonardi, S.: On-line network routing. In: Fiat, A., Woeginger, G.J. (eds.) Dagstuhl Seminar 1996. LNCS, vol. 1442, Springer, Berlin (1998)
Lewin-Eytan, L., Naor, J.S., Orda, A.: Routing and admission control in networks with advance reservations. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 215–228. Springer, Heidelberg (2002)
Micali, S., Vazirani, V.V.: An O(\(\sqrt{|V|}\cdot|E|\)) algorithm for finding maximum matchings in general graphs. In: Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 17–27 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adamy, U., Erlebach, T., Mitsche, D., Schurr, I., Speckmann, B., Welzl, E. (2005). Off-line Admission Control for Advance Reservations in Star Networks. In: Persiano, G., Solis-Oba, R. (eds) Approximation and Online Algorithms. WAOA 2004. Lecture Notes in Computer Science, vol 3351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31833-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-31833-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24574-2
Online ISBN: 978-3-540-31833-0
eBook Packages: Computer ScienceComputer Science (R0)