Next Article in Journal
Advances in Artificial Neural Networks – Methodological Development and Application
Previous Article in Journal
Computer-Aided Diagnosis Systems for Brain Diseases in Magnetic Resonance Images
Open AccessArticle

Improving the Competitive Ratio of the Online OVSF Code Assignment Problem

1
Academic Center for Computing and Media Studies, Kyoto University, Yoshida Honmachi, Sakyo-ku, Kyoto 606-8501, Japan
2
Graduate School of Informatics, Kyoto University, Yoshida Honmachi, Sakyo-ku, Kyoto 606-8501, Japan
*
Author to whom correspondence should be addressed.
Algorithms 2009, 2(3), 953-972; https://doi.org/10.3390/a2030953
Received: 7 May 2009 / Revised: 14 July 2009 / Accepted: 14 July 2009 / Published: 17 July 2009
Online OVSF code assignment has an important application to wireless communications. Recently, this problem was formally modeled as an online problem, and performances of online algorithms have been analyzed by the competitive analysis. The previous best upper 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 is tight by giving an input sequence for which the competitive ratio of our algorithm is 7 ― ε for an arbitrary constant ε > 0. View Full-Text
Keywords: online OVSF code assignment; online algorithm; competitive analysis online OVSF code assignment; online algorithm; competitive analysis
Show Figures

Graphical abstract

MDPI and ACS Style

Miyazaki, S.; Okamoto, K. Improving the Competitive Ratio of the Online OVSF Code Assignment Problem. Algorithms 2009, 2, 953-972.

Show more citation formats Show less citations formats

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Back to TopTop