Improving the Competitive Ratio of the Online OVSF Code Assignment Problem

Authors:
Shuichi Miyazaki;Kazuya Okamoto
Affiliations:
Academic Center for Computing and Media Studies, Kyoto University,;Graduate School of Informatics, Kyoto University,
Venue:
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Year:
2008

Citing 0
Cited 4

Online Tree Node Assignment with Resource Augmentation

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
SIGACT news online algorithms column 14

ACM SIGACT News
Online tree node assignment with resource augmentation

Journal of Combinatorial Optimization
Constant-competitive tree node assignment

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Online OVSF code assignment has an important application towireless communications. Recently, this problem was formallymodeled as an online problem, and performances of online algorithmshave been analyzed by the competitive analysis. The previous bestupper and lower bounds on the competitive ratio were 10 and 5/3,respectively. In this paper, we improve them to 7 and 2,respectively. We also show that our analysis for the upper bound istight by giving an input sequence for which the competitive ratioof our algorithm is 7 - ε for arbitraryε 0.