Predicting the Performance of Wide Area Data Transfers
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Resource Allocation with Persistent and Transient Flows
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Using Regression Techniques to Predict Large Data Transfers
International Journal of High Performance Computing Applications
Study of Dynamic Timeout Strategy based on flow rate metrics in high-speed networks
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
TCP symbiosis: congestion control mechanisms of TCP based on Lotka-Volterra competition model
Interperf '06 Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems
TCP fairness issues in IEEE 802.11 wireless LANs
Computer Communications
Size-based and direction-based TCP fairness issues in IEEE 802.11 WLANs
EURASIP Journal on Wireless Communications and Networking
MMACTEE'09 Proceedings of the 11th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
Preferential bandwidth allocation for short flows with active queue management
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
A new congestion control mechanism of TCP with inline network measurement
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Short Survey: A survey of TCP-friendly router-based AQM schemes
Computer Communications
Lifetime-based TCP service differentiation
Computer Communications
Hi-index | 0.00 |
Abstract Recent measurement based studies reveal that most of the Internet connections are short in terms of the amount of traffic they carry (mice), while a small fraction of the connections are carrying a large portion of the traffic (elephants). A careful study of the TCP protocol shows that without help from an Active Queue Management (AQM) policy, short connections tend to lose to long connections in their competition for bandwidth. This is because short connections do not gain detailed knowledge of the network state, and therefore they are doomed to be less competitive due to the conservative nature of the TCP congestion control algorithm. Inspired by the Differentiated Services (Diffserv) architecture, we propose to give preferential treatment to short connections inside the bottleneck queue, so that short connections experience less packet drop rate than long connections. This is done by employing the RIO (RED with In and Out) queue management policy which uses different drop functions for different classes of traffic. Our simulation results show that: (1) in a highly loaded network, preferential treatment is necessary to provide short TCP connections with better response time and fairness without hurting the performance of long TCP connections; (2) the proposed scheme still delivers packets in FIFO manner at each link, thus it maintains statistical multiplexing gain and does not misorder packets; (3) choosing a smaller default initial timeout value for TCP can help enhance the performance of short TCP flows, however not as effectively as our scheme and with the risk of congestion collapse; (4) in the worst case, our proposal works as well as a regular RED scheme, in terms of response time and goodput.