Skip to main content
SpringerLink
Log in

Improving the Competitive Ratio of the Online OVSF Code Assignment Problem

  • Conference paper
Algorithms and Computation (ISAAC 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5369))

Included in the following conference series:

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 arbitrary ε> 0.

This work was supported by KAKENHI 17700015, 19200001, 19 ·4017, and 20300028.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adachi, F., Sawahashi, M., Okawa, K.: Tree-structured generation of orthogonal spreading codes with different lengths for forward link of DS-CDMA mobile radio. Electronics Letters 33(1), 27–28 (1997)

    Article  Google Scholar 

  2. Chin, F.Y.L., Ting, H.F., Zhang, Y.: A constant-competitive algorithm for online OVSF code assignment. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 452–463. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Chin, F.Y.L., Zhang, Y., Zhu, H.: Online OVSF code assignment with resource augmentation. In: Kao, M.-Y., Li, X.-Y. (eds.) AAIM 2007. LNCS, vol. 4508, pp. 191–200. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  4. Erlebach, T., Jacob, R., Mihaľák, M., Nunkesser, M., Szabó, G., Widmayer, P.: An algorithmic view on OVSF code assignment. Algorithmica 47(3), 269–298 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Erlebach, T., Jacob, R., Tomamichel, M.: Algorithmische aspekte von OVSF code assignment mit schwerpunkt auf offline code assignment. Student thesis as ETH Zürich

    Google Scholar 

  6. Forišek, M., Katreniak, B., Katreniaková, J., Královič, R., Koutný, V., Pardubská, D., Plachetka, T., Rovan, B.: Online bandwidth allocation. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 546–557. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Minn, T., Siu, K.Y.: Dynamic assignment of orthogonal variable-spreading-factor codes in W-CDMA. IEEE Journal on Selected Areas in Communications 18(8), 1429–1440 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Academic Center for Computing and Media Studies, Kyoto University, Japan

    Shuichi Miyazaki

  2. Graduate School of Informatics, Kyoto University, Japan

    Kazuya Okamoto

Authors
  1. Shuichi Miyazaki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kazuya Okamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information Technologies, University of Sydney, Australia

    Seok-Hee Hong

  2. Graduate School of Informatics, Kyoto University, 606-8501, Kyoto, Japan

    Hiroshi Nagamochi

  3. Graduate School of Informatics, Kyoto University, Japan

    Takuro Fukunaga

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Miyazaki, S., Okamoto, K. (2008). Improving the Competitive Ratio of the Online OVSF Code Assignment Problem. In: Hong, SH., Nagamochi, H., Fukunaga, T. (eds) Algorithms and Computation. ISAAC 2008. Lecture Notes in Computer Science, vol 5369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92182-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92182-0_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92181-3

  • Online ISBN: 978-3-540-92182-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation