Abstract
This paper studies the online Orthogonal Variable Spreading Factor (OVSF) code assignment problem with resource augmentation introduced by Erlebach et al. in [8]. We propose a (1 + ε)-competitive algorithm with help of \((1+\lceil 1/\varepsilon \rceil)\lg^{*} h\) trees for the height h of the OVSF code tree and any constant 0 < ε ≤ 1. In the case of ε = 1, we obtain a 2-competitive algorithm with \(2\lg^{*} h\) trees, which substantially improves the previous resource of 3h/8 + 2 trees shown by Chan et al. in [2].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Albers, S., Arora, S., Khanna, S.: Page replacement for general caching problems. In: 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1999), pp. 31–40 (1999)
Chan, J.W.T., Chin, F.Y.L., Ting, H.F., Zhang, Y.: Online tree node assignment with resource augmentation. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol. 5609, pp. 358–367. Springer, Heidelberg (2009)
Chan, J.W.T., Chin, F.Y.L., Ting, H.F., Zhang, Y.: Online problems for frequency assignment and OVSF code assignment in wireless communication networks. ACM SIGACT News 40(3), 86–98 (2009)
Chin, F.Y.L., Ting, H.F., Zhang, Y.: A constant-competitive algorithm for online OVSF code assignment. Algorithmica 56(1), 89–104 (2010)
Chin, F.Y.L., Ting, H.F., Zhang, Y.: Constant-competitive tree node assignment (manuscript)
Chin, F.Y.L., Zhang, Y., Zhu, H.: Online OVSF code assignment with resource augmentation. In: Kao, M.-Y., Li, X.-Y. (eds.) AAIM 2007. LNCS, vol. 4508, pp. 191–200. Springer, Heidelberg (2007)
Epstein, L., Stee, R.v.: Online bin packing with resource augmentation. Discrete Optimization 4, 322–333 (2007)
Erlebach, T., Jacob, R., Mihalák, M., Nunkesser, M., Szabó, G., Widmayer, P.: An algorithmic view on OVSF code assignment. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 270–281. Springer, Heidelberg (2004)
Forišek, M., Katreniak, B., Katreniaková, J., Královič, R., Královič, R., Koutný, V., Pardubská, D., Plachetka, T., Rovan, B.: Online bandwidth allocation. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 546–557. Springer, Heidelberg (2007)
Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM 47(4), 617–643 (2000)
Miyazaki, S., Okamoto, K.: Improving the competitive ratio of the online OVSF code assignment problem. Algorithms 2(3), 953–972 (2009)
Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. Algorithmica 32(3), 163–200 (2002)
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
Asahiro, Y., Kanmera, K., Miyano, E. (2011). (1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation. In: Fu, B., Du, DZ. (eds) Computing and Combinatorics. COCOON 2011. Lecture Notes in Computer Science, vol 6842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22685-4_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-22685-4_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22684-7
Online ISBN: 978-3-642-22685-4
eBook Packages: Computer ScienceComputer Science (R0)