Academic Commons

Reports

An Optimal Algorithm for Scheduling Reservations in a Bandwidth Market

Olshefski, David; Zhang, Li; Florissi, Danilo; Yemini, Yechiam

An algorithm is presented which provides an optimal
solution to the problem of scheduling non-relocatable time
intervals of bandwidth in differentiated services networks.
Simulations found an asymmetry between valuing an interval’s
length and bandwidth requirement. Longer intervals requiring
less resource are favored over shorter intervals requiring more
resource. The optimal algorithm is shown to respond appropriately
to price as a mechanism of control whereas the offline
greedy and the online FCFS algorithms do not. The solution
uses integer programming, and it is shown that, except in the
general case, the problem can be solved in polynomial time.

Subjects

Files

More About This Work

Academic Units
Computer Science
Publisher
Department of Computer Science, Columbia University
Series
Columbia University Computer Science Technical Reports, CUCS-024-99
Published Here
April 21, 2011
Academic Commons provides global access to research and scholarship produced at Columbia University, Barnard College, Teachers College, Union Theological Seminary and Jewish Theological Seminary. Academic Commons is managed by the Columbia University Libraries.