Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Empirically derived analytic models of wide-area TCP connections
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
A simulation study of IP switching
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
Explicit allocation of best-effort packet delivery service
IEEE/ACM Transactions on Networking (TON)
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Passive estimation of TCP round-trip times
ACM SIGCOMM Computer Communication Review
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Preferential treatment for short flows to reduce web latency
Computer Networks: The International Journal of Computer and Telecommunications Networking
Differentiated predictive fair service for TCP flows
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
The War Between Mice and Elephants
The War Between Mice and Elephants
Scalable tcp congestion control
Scalable tcp congestion control
TCP-friendly marking for scalable best-effort services on the internet
ACM SIGCOMM Computer Communication Review - Special issue on wireless extensions to the internet
Realizing Throughput Guarantees in a Differentiated Services Network
ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02
Flow labelled IP: a connectionless approach to ATM
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Understanding Internet traffic streams: dragonflies and tortoises
IEEE Communications Magazine
Improving fairness among TCP flows by stateless buffer control with early drop maximum
Information Sciences: an International Journal
| Hi-index | 0.24 |
We present a lifetime-based differentiation framework for TCP flows. The separation into two classes is based on a threshold technique. We introduce a scheme, FairShare, that handles the long-lived flows and achieves global max-min fairness. The short-lived flows are bundled together and a separate family of mechanisms, DAS, dynamically allocate bandwidth to match the load of newly instantiated short flows. Thus, two different objectives are met: fairness for the long flows, as well as reduced response times and reduced response time variance for the short flows. We argue that the applications are better served this way. Namely, applications generating short transfers are predominantly interested in short response times (e.g. HTTP requests/responses) while those generating long transfers (e.g. long FTP transfers) are at least provided a guarantee they are not penalized compared to other similar connections. By way of an example, we also demonstrate that elaborate traffic control schemes that do not perform classification of flows based on their anticipated lifetimes, may fail to efficiently utilize the network links.