Abstract
We consider the problem of scheduling resource allocation where a change in allocation results in a changeover penalty of one time slot. We assume that we are sending packets over a wireless channel of uncertain and varying capacity. In each time slot, a bandwidth of at most the current capacity can be allocated, but changing the capacity has a cost, which is modeled as an empty time slot. Only the current bandwidth and the bandwidth of the immediately following slot are known. We give an online algorithm with competitive ratio 1.753 for this problem, improving over the previous upper bound of 1.848. The main new idea of our algorithm is that it attempts to avoid cases where a single time slot with a nonzero allocation is immediately followed by an empty time slot. Additionally, we improve the lower bound for this problem to 1.6959. Our results significantly narrow the gap between the best known upper and lower bound.
Research supported by the German Research Foundation (DFG).
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
Arora, A., Choi, H.-A.: Channel aware scheduling in wireless networks. Technical Report 002, George Washington University (2006)
Arora, A., Jin, F., Choi, H.-A.: Scheduling resource allocation with timeslot penalty for changeover. Theor. Comput. Sci. 369(1-3), 323–337 (2006)
Borst, S.C.: User-level performance of channel-aware scheduling algorithms in wireless data networks. In: INFOCOM (2003)
Epstein, L., Levin, A.: Private communication (2009)
Stallings, W.: Wireless Communication & Networks. Prentice Hall, Englewood Cliffs (2001)
Tsibonis, V., Georgiadis, L., Tassiulas, L.: Exploiting wireless channel state information for throughput maximization. In: INFOCOM (2003)
Wang, H., Chaudhary, A., Chen, D.Z.: Online rectangle filling. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 274–287. Springer, Heidelberg (2008)
Wang, H., Chaudhary, A., Chen, D.Z.: New algorithms for online rectangle filling with k-lookahead. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 385–394. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Stee, R. (2011). An Improved Algorithm for Online Rectangle Filling. In: Jansen, K., Solis-Oba, R. (eds) Approximation and Online Algorithms. WAOA 2010. Lecture Notes in Computer Science, vol 6534. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18318-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-18318-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18317-1
Online ISBN: 978-3-642-18318-8
eBook Packages: Computer ScienceComputer Science (R0)