Sciweavers

INFOCOM
2003
IEEE

Optimal Sliding-Window Strategies in Networks with Long Round-Trip Delays

14 years 5 months ago
Optimal Sliding-Window Strategies in Networks with Long Round-Trip Delays
— A method commonly used for packet flow control over connections with long round-trip delays is “sliding windows”. In general, for a given loss rate, a larger window size achieves a higher average throughput, but also a higher rate of spurious packet transmissions, rejected by the receiver merely for arriving out-of-order. This paper analyzes the problem of optimal flow control quantitatively, for a connection that has a cost per unit time and a cost for every transmitted packet (these costs can have generic interpretations, not necessarily in terms of money). The optimal strategy is defined as one that minimizes the expected cost/throughput ratio, and is allowed to transmit several copies of a packet within a window. We derive bounds on the performance of the optimal strategy; in particular, we show that the optimal cost/throughput ratio increases merely logarithmically with the time price. We present a method for computing the optimal strategy, and demonstrate that a simple...
Lavy Libman, Ariel Orda
Added 04 Jul 2010
Updated 04 Jul 2010
Type Conference
Year 2003
Where INFOCOM
Authors Lavy Libman, Ariel Orda
Comments (0)