Next Article in Journal
Previous Article in Journal
Algorithms 2009, 2(3), 953-972; doi:10.3390/a2030953
Article

Improving the Competitive Ratio of the Online OVSF Code Assignment Problem

1
 and 2,*
Received: 7 May 2009; in revised form: 14 July 2009 / Accepted: 14 July 2009 / Published: 17 July 2009
Download PDF [349 KB, uploaded 17 July 2009]
Abstract: 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.
Keywords: online OVSF code assignment; online algorithm; competitive analysis online OVSF code assignment; online algorithm; competitive analysis
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Export to BibTeX |
EndNote


MDPI and ACS Style

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

AMA Style

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

Chicago/Turabian Style

Miyazaki, Shuichi; Okamoto, Kazuya. 2009. "Improving the Competitive Ratio of the Online OVSF Code Assignment Problem." Algorithms 2, no. 3: 953-972.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert