(1 + ε)-competitive algorithm for online OVSF code assignment with resource augmentation

Authors:
Yuichi Asahiro;Kenta Kanmera;Eiji Miyano
Affiliations:
Department of Information Science, Kyushu Sangyo University, Fukuoka, Japan;Department of Systems Design and Informatics, Kyushu Institute of Technology, Fukuoka, Japan;Department of Systems Design and Informatics, Kyushu Institute of Technology, Fukuoka, Japan
Venue:
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Year:
2011

Citing 7
Cited 0

Page replacement for general caching problems

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
Online OVSF Code Assignment with Resource Augmentation

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Online Tree Node Assignment with Resource Augmentation

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
A Constant-Competitive Algorithm for Online OVSF Code Assignment

Algorithmica - Special Issue: Algorithms and Computation; Guest Editor: Takeshi Tokuyama
Online bandwidth allocation

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Online bin packing with resource augmentation

Discrete Optimization

Quantified Score

Hi-index	0.02

Visualization

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+⌈1/ε⌉) lg*h trees for the height h of the OVSF code tree and any constant 0 h trees, which substantially improves the previous resource of 3h/8 + 2 trees shown by Chan et al. in [2].