Download now Free registration required
Advance channel reservation is emerging as an important feature of ultra high-speed networks requiring the transfer of large files. In this paper, the authors 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. They 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.
- Format: PDF
- Size: 112.89 KB