Abstract
This paper studies the online Orthogonal Variable Spreading Factor (OVSF) code assignment problem with resource augmentation introduced by Erlebach et al. (in STACS 2004. LNCS, vol. 2996, pp. 270–281, 2004). We propose a (1+1/α)-competitive algorithm with help of (1+⌈α⌉)lg∗ h trees for the height h of the OVSF code tree and any α≥1. In other words, it is a (1+ε)-competitive algorithm with help of (1+⌈1/ε⌉)lg∗ h trees for any constant 0<ε≤1. In the case of α=1 (or ε=1), we obtain a 2-competitive algorithm with 2lg∗ h trees, which substantially improves the previous resource of 3h/8+2 trees shown by Chan et al. (COCOON 2009. LNCS, vol. 5609, pp. 358–367, 2009). In another aspect, if it is not necessary to bound the incurred cost for individual requests to a constant, an amortized (4/3+δ)-competitive algorithm with (11/4+4/(3δ)) trees for any 0<δ≤4/3 is also designed in Chan et al. (COCOON 2009. LNCS, vol. 5609, pp. 358–367, 2009). The algorithm in this paper gives us a new trade-off between the competitive ratio and the resource augmentation when α≥3 (or ε≤1/3), although the incurred cost for individual requests is bounded to a constant.
Similar content being viewed by others
Notes
The algorithm ALG 1 does not care about the order of black j-subtrees, however we use the subscript k’s to distinguish black j-subtrees in the explanation of the paper.
References
Albers S, Arora S, Khanna S (1999) Page replacement for general caching problems. In: 10th annual ACM-SIAM symposium on discrete algorithms (SODA’99), pp 31–40
Chan JWT, Chin FYL, Ting HF, Zhang Y (2009) Online tree node assignment with resource augmentation. In: Ngo HQ (ed) COCOON 2009. LNCS, vol 5609. Springer, Berlin, pp 358–367
Chan JWT, Chin FYL, Ting HF, Zhang Y (2009) Online problems for frequency assignment and OVSF code assignment in wireless communication networks. ACM SIGACT News 40(3):86–98
Chin FYL, Ting HF, Zhang Y (2010) A constant-competitive algorithm for online OVSF code assignment. Algorithmica 56(1):89–104
Chin FYL, Ting HF, Zhang Y Constant-competitive tree node assignment. Manuscript
Chin FYL, Zhang Y, Zhu H (2007) Online OVSF code assignment with resource augmentation. In: Kao MY, Li XX (eds) AAIM 2007. LNCS, vol 4508. Springer, Berlin, pp 191–200
Epstein L, Stee RV (2007) Online bin packing with resource augmentation. Discrete Optim 4:322–333
Erlebach T, Jacob R, Mihalák M, Nunkesser M, Szabó G, Widmayer P (2004) An algorithmic view on OVSF code assignment. In: Diekert V, Habib M (eds) STACS 2004. LNCS, vol 2996. Springer, Berlin, pp 270–281 (conference version of Algorithmica 47(3):269–298 (2007))
Forišek M, Katreniak B, Katreniaková J, Královič R, Královič R, Koutný V, Pardubská D, Plachetka T, Rovan B (2007) Online bandwidth allocation. In: Arge L, Hoffmann M, Welzl E (eds) ESA 2007. LNCS, vol 4698. Springer, Berlin, pp 546–557
Kalyanasundaram B, Pruhs K (2000) Speed is as powerful as clairvoyance. J ACM 47(4):617–643
Miyazaki S, Okamoto K (2009) Improving the competitive ratio of the online OVSF code assignment problem. Algorithms 2(3):953–972
Phillips CA, Stein C, Torng E, Wein J (2002) Optimal time-critical scheduling via resource augmentation. Algorithmica 32(3):163–200
Acknowledgements
This work is partially supported by KAKENHI, 22700019 and 23500020.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Asahiro, Y., Kanmera, K. & Miyano, E. (1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation. J Comb Optim 26, 687–708 (2013). https://doi.org/10.1007/s10878-012-9454-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-012-9454-2