|Title:||Improving the Competitive Ratio of the Online OVSF Code Assignment Problem|
|Authors:||Miyazaki, Shuichi https://orcid.org/0000-0003-0369-1970 (unconfirmed)|
Okamoto, Kazuya https://orcid.org/0000-0002-9079-2253 (unconfirmed)
|Author's alias:||宮崎, 修一|
|Keywords:||online OVSF code assignment|
|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.|
|Rights:||© 2009 by the authors; licensee Molecular Diversity Preservation International, Basel, Switzerland.|
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).
|Appears in Collections:||Journal Articles|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.