(1+epsilon)-competitive algorithm for online OVSF code assignment with resource augmentation
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/alpha)-competitive algorithm with help of (1 + left perpendicular alpha right perpendicular) lg*h trees for the height h of the OVSF code tree and any alpha >= 1. In other words, it is a (1 + epsilon)-competitive algorithm with help of (1 + left perpendicular 1/epsilon right perpendicular)lg*h trees for any constant 0  = 3 (or epsilon <= 1/3), although the incurred cost for individual requests is bounded to a constant.
resource augmentation online ovsf code assignment problem competitive algorithm