TCP/IP illustrated (vol. 1): the protocols
TCP/IP illustrated (vol. 1): the protocols
TCP Vegas: new techniques for congestion detection and avoidance
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
Some observations on the dynamics of a congestion control algorithm
ACM SIGCOMM Computer Communication Review
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
General AIMD congestion control
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
The War Between Mice and Elephants
The War Between Mice and Elephants
QoS's downfall: at the bottom, or not at all!
RIPQoS '03 Proceedings of the ACM SIGCOMM workshop on Revisiting IP QoS: What have we learned, why do we care?
Toward self-organizing, self-repairing and resilient distributed systems
Future directions in distributed computing
A merged inline measurement method for capacity and available bandwidth
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
Inline bandwidth measurement techniques for gigabit networks
International Journal of Internet Protocol Technology
ICANN '09 Proceedings of the 19th International Conference on Artificial Neural Networks: Part II
Hi-index | 0.00 |
In this paper, we propose TCP Symbiosis, which has a robust, self-adaptive and scalable congestion control mechanism for TCP. Our method is quite different from existing approaches. We change the window size of a TCP connection in response to information of the physical and available bandwidths of the end-to-end network path. The bandwidth information is obtained by an inline network measurement technique we have previously developed. Using the bandwidth information we can resolve the inherent problems in existing AIMD/MIMD-based algorithms such as periodic packet loss and unfairness caused by the difference in RTT. We borrow algorithms from biophysics to update the window size: the logistic growth model and the Lotka-Volterra competition model. This is because these models describe changes in the population size of a species that depends on the living environment. The population of a species can be viewed as the window size of a TCP connection and the living environment as the bandwidth of the bottleneck link. The greatest advantage of using these models is that we can refer to previous discussions and results for various characteristics of the mathematical models, including scalability, convergence, fairness and stability in these models. Through mathematical analysis and extensive simulation experiments, we compare the proposed mechanism with traditional TCP Reno, HighSpeed TCP, Scalable TCP and FAST TCP, and exhibit its effectiveness in terms of scalability to the network bandwidth and delay, convergence time, fairness among competing connections, and stability.