Online Bandwidth Allocation
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  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 , 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.
KeywordsCompetitive Ratio Online Algorithm Universal Mobile Telecommunication System Universal Mobile Telecommunication System Code Assignment
Unable to display preview. Download preview PDF.
- 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.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
- 8.Wikipedia. Universal mobile telecommunications system. Available at: From Wikipedia, the free encyclopedia [Online; accessed 23. March (2006)], http://en.wikipedia.org/wiki/Umts