Abstract
The problem we consider is motivated by allocating bandwidth slots to communication requests on a satellite channel under real time constraints. Accepted requests must be scheduled on non-intersecting rectangles in the time/bandwidth Cartesian space with the goal of maximizing the benefit obtained from accepted requests. This problem turns out to be equal to the maximization version of the well known Dynamic Storage Allocation problem when storage size is limited and requests must be accommodated within a prescribed time interval.
We present constant approximation algorithms for the problem introduced in this paper using as a basic step the solution of a fractional Linear Programming formulation.
This problem has been independently studied by Bar-Noy et al [BNBYF+00] with different techniques. Our approach gives an improved approximation ratio for the problem.
Partially supported by the IST Programme of the EU under contract number IST-1999-14186 (ALCOM-FT), IST-1999-10440 (BRAHMS) and IST-2000-14084 (APPOL), and by the Italian Research Project MURST 40% “Resource Allocation in Computer Networks”.
Partially supported by Etnoteam (Italy).
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
Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph (Seffi) Naor, and Baruch Schieber. A unified approach to approximating resource allocation and scheduling. In Proceedings of the Thirty-Second Annual ACM Symposium on the Theory of Computing, Las Vegas, Nevada, 2000.
Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, and Baruch Schieber. Bandwidth allocation with preemption. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 616–625, Las Vegas, Nevada, 29 May-1 June 1995.
Amotz Bar-Noy, Sudipto Guha, Joseph (Se.) Naor, and Baruch Schieber. Approximating the throughput of multiple machines under real-time scheduling. In Proceedings of the thirty-first annual ACM symposium on Theory of computing, pages 622–631, Atlanta, GA USA, 1-4 May 1999.
Jordan Gergov. Approximation algorithms for dynamic storage allocation. In European Symposium on Algorithms (ESA’96), volume 1136 of Lecture Notes in Computer Science, pages 52–61. Springer, 1996.
Jordan Gergov. Algorithms for compile-time memory optimization. In Proc. of the 10th ACM-SIAM Symposium on Discrete Algorithms, pages 907–908, 1999.
Juan A. Garay, Inder S. Gopal, and Shay Kutten. Efficient on-line call control algorithms. Journal of Algorithms, 23(1):180–194, April 1997.
M. R. Garey and D. S. Johnson. Computers and Intractability-A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
H. A. Kierstead. A polynomial time approximation algorithm for dynamic storage allocation. Disccrete Mathematics, 88:231–237, 1991.
D.E. Knuth. The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 2nd Edition. Addison-Wesley, 1973.
M. Slusarek. A coloring algorithm for interval graphs. In Proc. of the 14th Mathematical Foundations of Computer Science, pages 471–480, 1989.
F.C.R. Spieksma. On the approximability of an interval scheduling problem. Journal of Scheduling, 2:215–2227, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leonardi, S., Marchetti-Spaccamela, A., Vitaletti, A. (2000). Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints. In: Kapoor, S., Prasad, S. (eds) FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2000. Lecture Notes in Computer Science, vol 1974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44450-5_33
Download citation
DOI: https://doi.org/10.1007/3-540-44450-5_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41413-1
Online ISBN: 978-3-540-44450-3
eBook Packages: Springer Book Archive