Competitive advance reservation with bounded path dispersion

Reuven Cohen, Niloofar Fazlollahi, David Starobinski

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


Advance channel reservation is emerging as an important feature of ultra high-speed networks requiring the transfer of large files. In this paper, we present two new delay-competitive algorithms for advance reservation, called BatchAll and BatchLim. These algorithms are guaranteed to achieve optimal throughput performance, based on multi-commodity flow arguments. Unlike BatchAll, the BatchLim algorithm returns the completion time of a connection immediately as a request is placed, but at the expense of a slightly looser competitive ratio than that of BatchAll. We propose a simple approach that limits the number of parallel paths used by the algorithms while provably bounding the maximum reduction factor in the transmission throughput. We show that, although the number of different paths can be exponentially large, the actual number of paths needed to approximate the flow is quite small and proportional to the number of edges in the network. According to our simulations for a number of topologies, three to five parallel paths are sufficient to achieve close to optimal performance.

Original languageEnglish
Title of host publication2008 IEEE INFOCOM Workshops
StatePublished - 2008
Event2008 IEEE INFOCOM Workshops - Phoenix, AZ, United States
Duration: 13 Apr 200818 Apr 2008

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X


Conference2008 IEEE INFOCOM Workshops
Country/TerritoryUnited States
CityPhoenix, AZ


Dive into the research topics of 'Competitive advance reservation with bounded path dispersion'. Together they form a unique fingerprint.

Cite this