Advertisement

Online Bandwidth Allocation

  • Michal Forišek
  • Branislav Katreniak
  • Jana Katreniaková
  • Rastislav Královič
  • Richard Královič
  • Vladimír Koutný
  • Dana Pardubská
  • Tomáš Plachetka
  • Branislav Rovan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4698)

Abstract

The paper investigates a version of the resource allocation problem arising in the wireless networking, namely in the OVSF code reallocation process. In this setting a complete binary tree of a given height n is considered, together with a sequence of requests which have to be served in an online manner. The requests are of two types: an insertion request requires to allocate a complete subtree of a given height, and a deletion request frees a given allocated subtree. In order to serve an insertion request it might be necessary to move some already allocated subtrees to other locations in order to free a large enough subtree. We are interested in the worst case average number of such reallocations needed to serve a request.

In [4] the authors delivered bounds on the competitive ratio of online algorithm solving this problem, and showed that the ratio is between 1.5 and O(n). We partially answer their question about the exact value by giving an O(1)-competitive online algorithm.

In [3], authors use the same model in the context of memory management systems, and analyze the number of reallocations needed to serve a request in the worst case. In this setting, our result is a corresponding amortized analysis.

Keywords

Competitive Ratio Online Algorithm Universal Mobile Telecommunication System Universal Mobile Telecommunication System Code Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adachi, F., Sawahashi, M., Okawa, K.: Tree structured generation of orthogonal spreading codes with different lengths for the forward link of DS-CDMA mobile radio. IEE Electronic Letters 33(1), 27–28 (1997)CrossRefGoogle Scholar
  2. 2.
    Brodal, G.S., Demaine, E.D., Munro, J.I.: Fast allocation and deallocation with an improved buddy system. Acta Informatica 41(4–5), 273–291 (2005)zbMATHCrossRefGoogle Scholar
  3. 3.
    Defoe, D.C., Cholleti, S.R., Cytron, R.K.: Upper bound for defragmenting buddy heaps. In: LCTES 2005. Proceedings of the 2005 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems, pp. 222–229. ACM Press, New York, USA (2005)CrossRefGoogle Scholar
  4. 4.
    Erlebach, T., Jacob, R., Mihalák, M., Nunkesser, M., Szabó, G., Widmayer, P.: An algorithmic view on OVSF code assignment. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 270–281. Springer, Heidelberg (2004)Google Scholar
  5. 5.
    Forišek, M., Katreniak, B., Katreniaková, J., Královič, R., Královič, R., Koutný, V., Pardubská, D., Plachetka, T., Rovan, B.: Online bandwidth allocation. Technical report, arXiv:cs/0701153v1 (2007)Google Scholar
  6. 6.
    Knowlton, K.C.: A fast storage allocator. Communications of ACM 8(10), 623–624 (1965)zbMATHCrossRefGoogle Scholar
  7. 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)CrossRefGoogle Scholar
  8. 8.
    Wikipedia. Universal mobile telecommunications system. Available at: From Wikipedia, the free encyclopedia [Online; accessed 23. March (2006)], http://en.wikipedia.org/wiki/Umts

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Michal Forišek
    • 1
  • Branislav Katreniak
    • 1
  • Jana Katreniaková
    • 1
  • Rastislav Královič
    • 1
  • Richard Královič
    • 1
    • 2
  • Vladimír Koutný
    • 1
  • Dana Pardubská
    • 1
  • Tomáš Plachetka
    • 1
  • Branislav Rovan
    • 1
  1. 1.Dept. of Computer Science, Comenius University, Mlynská dolina, 84248 BratislavaSlovakia
  2. 2.Dept. of Computer Science, ETH ZürichSwitzerland

Personalised recommendations