Change search
ReferencesLink to record
Permanent link

Direct link
Data structure for a time-based bandwidth reservations problem
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Embedded Internet Systems Lab.
2003 (English)Report (Other academic)
Abstract [en]

We discuss a problem of handling resource reservations. The resource can be reserved for some time, it can be freed or it can be queried what is the largest amount of reserved resource during a time interval. We show that the problem has a lower bound of $\Omega(\log n)$ per operation on average and we give a matching upper bound algorithm. Our solution also solves a dynamic version of the related problems of a prefix sum and a partial sum.

Place, publisher, year, edition, pages
Ljubljana, Slovenia: IMFM , 2003. , 10 p.
Research subject
Dependable Communication and Computation Systems
URN: urn:nbn:se:ltu:diva-23900Local ID: 8dd5e990-9770-11dc-ad7f-000ea68e967bOAI: diva2:996950
Godkänd; 2003; 20071120 (ysko)Available from: 2016-09-29 Created: 2016-09-29Bibliographically approved

Open Access in DiVA

fulltext(348 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 348 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Search in DiVA

By author/editor
Brodnik, AndrejNilsson, Andreas
By organisation
Embedded Internet Systems Lab

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 2 hits
ReferencesLink to record
Permanent link

Direct link