A study of a high speed packet scheduling method for achieving fairness among TCP connections

Authors:
Go Hasegawa;Kenji Kurata;Masayuki Murata
Affiliations:
Cybermedia Center, Osaka University, Osaka 560-0043, Japan;Cybermedia Center, Osaka University, Osaka 560-0043, Japan;Cybermedia Center, Osaka University, Osaka 560-0043, Japan
Venue:
Journal of High Speed Networks
Year:
2003

Citing 12
Cited 1

TCP/IP illustrated (vol. 1): the protocols

TCP/IP illustrated (vol. 1): the protocols
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
TCP Vegas: new techniques for congestion detection and avoidance

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Improvements to TCP performance in high-speed ATM networks

Communications of the ACM
Evaluation of TCP Vegas: emulation and experiment

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
Simulation-based comparisons of Tahoe, Reno and SACK TCP

ACM SIGCOMM Computer Communication Review
Forward acknowledgement: refining TCP congestion control

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Dynamics of random early detection

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Promoting the use of end-to-end congestion control in the Internet

IEEE/ACM Transactions on Networking (TON)
TCP Vegas: end to end congestion avoidance on a global Internet

IEEE Journal on Selected Areas in Communications

Queue delay estimation and its application to TCP Vegas

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we first investigate the fairness between TCP Reno and TCP Vegas by focusing on the situation where Reno and vegas connections share the bottleneck link. From the analysis and the simulation results, we find that the performance of TCP Vegas is much smaller than that of TCP Reno as opposed to an expectation on TCP Vegas. The RED algorithm improves the fairness to some degree, but there still be an inevitable trade-off between fairness and throughput. Accordingly, we propose a ZL-RED (Zombie Listed RED) algorithm, which enhances the RED algorithm to provide fair service for many flows at the bottleneck router. ZL-RED uses the Zombie List, which has been originally proposed by SRED, to detect mis-behaving flows which send packets at higher rate than others. Then, ZL-RED sets higher packet discarding probabilities for those mis-behaving flows. We evaluate an effectiveness of ZL-RED by simulation experiments, and show that ZL-RED can actually improve fairness among TCP connections.