Aggregated aggressiveness control on groups of TCP flows

Authors:
Soohyun Cho;Riccardo Bettati
Affiliations:
Computer Science Department, Texas A&M University, College Station, TX;Computer Science Department, Texas A&M University, College Station, TX
Venue:
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Year:
2005

Citing 6
Cited 2

End-to-end Internet packet dynamics

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Differentiated end-to-end Internet services using a weighted proportional fair sharing TCP

ACM SIGCOMM Computer Communication Review
An integrated congestion management architecture for Internet hosts

Proceedings of the 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)
Congestion Control in Linux TCP

Proceedings of the FREENIX Track: 2002 USENIX Annual Technical Conference
NIST Net: a Linux-based network emulation tool

ACM SIGCOMM Computer Communication Review

Application Centric Autonomic BW Control in Utility Computing

GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
Use of competition detection in TCP for simple topology networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The use of multiple concurrent parallel TCP flows is an easy way to achieve higher speed reliable data transfers. However, parallel TCP flows are inherently unfair with respect to single TCP flows. We suggest a new scheme called TCP-P, which controls aggressiveness of a group of parallel TCP flows by regulating their total aggressiveness (or unfairness) to be comparable to a single TCP flow, or any multiple thereof. TCP-P makes a group of N parallel TCP flows appear to other flows like k separable TCP flows – i.e., have strength k – through appropriate manipulations of increase and decrease behavior of the congestion windows of the TCP flows in the group. We implemented our scheme as part of Linux and experimental results show that the proposed scheme effectively controls aggressiveness of parallel TCP flows.