Data Structure for a Time-Based Bandwidth Reservations Problem

Details Data Structure for a Time-Based Bandwidth Reservations Problem Data Structure for a Time-Based Bandwidth Reservations Problem

2003-02-06

arxiv.org/abs/cs/0302009v1

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Data Structure for a Time-Based Bandwidth Reservations Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Data Structure for a Time-Based Bandwidth Reservations Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data Structure for a Time-Based Bandwidth Reservations Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-99483