Optimal sliding-window strategies in networks with long round-trip delays

Authors:
Lavy Libman;Ariel Orda
Affiliations:
National ICT Australia, Bay 15, Australian Technology Park, Eveleigh, NSW 1430, Australia and Technion--Israel Institute of Technology;Department of Electrical Engineering, Technion--Israel Institute of Technology, Haifa 32000, Israel
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2004

Citing 7
Cited 2

Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Dynamics of random early detection

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Computer Networks

Computer Networks
Optimal retrial and timeout strategies for accessing network resources

IEEE/ACM Transactions on Networking (TON)
Bandwidth tradeoff between TCP and link-level FEC

Computer Networks: The International Journal of Computer and Telecommunications Networking
Congestion control for high bandwidth-delay product networks

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
AFEC: An Adaptive Forward Error Correction Protocol for End-to-End Transport of Real-Time Traffic

IC3N '98 Proceedings of the International Conference on Computer Communications and Networks

Equilibria in online games

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On reliable transmission of data over simple wireless channels

Journal of Computer Systems, Networks, and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. 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 present an algorithm for computing the optimal strategy and study its properties; in particular, we derive bounds on the optimal strategy cost/throughput performance, and show that it increases merely logarithmically with the time price, whereas the cost/throughput of the 'traditional' classic window scheme is linear in the time price.