TY - GEN

T1 - Competitive advance reservation with bounded path dispersion

AU - Cohen, Reuven

AU - Fazlollahi, Niloofar

AU - Starobinski, David

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=51049107300&partnerID=8YFLogxK

U2 - 10.1109/INFOCOM.2008.4544635

DO - 10.1109/INFOCOM.2008.4544635

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:51049107300

SN - 9781424422197

T3 - Proceedings - IEEE INFOCOM

BT - 2008 IEEE INFOCOM Workshops

T2 - 2008 IEEE INFOCOM Workshops

Y2 - 13 April 2008 through 18 April 2008

ER -