Analytic understanding of RED gateways with multiple competing TCP flows
نویسندگان
چکیده
An analytical framework for multiple TCP flows sharing a bottleneck link under the Random Early Detection (RED) regime is developed. Closed form expressions for the steady state throughput and average queueing delay are derived and verified by simulations; these show that RED significantly improves the inherent TCP bias against links with higher round-trip delays as compared to Tail Drop, contrary to prevailing belief. Further, we derive closed form bounds on the minimum average queuing delay achievable through a RED gateway with no deterministic packet drop.
منابع مشابه
Understanding the performance of many TCP flows
As the most widely used reliable transport in today’s Internet, TCP has been extensively studied in the past decade. However, previous research usually only considers a small or medium number of concurrent TCP connections. The TCP behavior under many competing TCP flows has not been sufficiently explored. In this paper 1, we use extensive simulations to systematically investigate the performanc...
متن کاملQueue dynamics of RED gateways under large number of TCP flows
We consider a stochastic model of a RED gateway under competing TCP-like sources sharing the capacity. As the number of competing flows becomes large, the queue behavior of RED can be described by a two-dimensional recursion. We confirm the result by simulations and discuss their implications for the network dimensioning problem.
متن کاملLimit Behavior of ECN/RED Gateways Under a Large Number of TCP Flows
We consider a stochastic model of an ECN/RED gateway with competing TCP sources sharing the capacity. As the number of competing flows becomes large, the queue behavior at the gateway can be described by a two-dimensional recursion and the throughput behavior of individual TCP flows becomes asymptotically independent. The steady-state regime of the limiting behavior can be calculated from a wel...
متن کاملPacket Loss of Congestion Control Using Early Random in Network
Congestion control of a variable bit-rate data stream crossing the Internet is crucial to ensuring the quality of the received data. This paper discusses the use of link-sharing mechanisms in packet networks and presents algorithms for hierarchical link-sharing. Hierarchical linksharing allows multiple agencies, protocol families, or traffic types to share the bandwidth on a link in a controlle...
متن کاملModeling TCP Traffic with Session Dynamics - Many Sources Asymptotics under ECN/RED Gateways
Short-lived TCP traffic (e.g., Web mice) composes the majority of the current Internet traffic. Accurate traffic modeling of a large number of short-lived TCP flows is extremely difficult due to (i) the complex interactions between session, transport and network layers; and (ii) the state space explosion when the number of flows is large. As a result, ad-hoc assumptions are often required for t...
متن کامل