TCP - IP White Papers
Differentiation Between Short and Long TCP Flows: Predictability of the Response Time
Overview Internet measurements show that a small number of large TCP flows are responsible for the largest amount of data transferred, whereas most of the TCP sessions are made up of few packets. Several authors have invoked this property to suggest the use of scheduling algorithms which favor short jobs, such as LAS (Least Attained Service), to differentiate between short and long TCP flows. This paper proposes a packet level stateless; threshold based scheduling mechanism for TCP flows, RuN2C. It describes an implementation of this mechanism which has the advantage of being TCP compatible and progressively deployable. The behavior of RuN2C with LAS based mechanisms through analytical models and simulations is compared.
| Publisher | Institute of Electrical and Electronics Engineers | File Format | |
|---|---|---|---|
| Date Published | February 2004 | ||
| Format | White Papers | ||
| Topics | |||


