Parallel TCP sockets: Simple model, throughput and validation

Proceedings - IEEE INFOCOM

Volumn , Issue , 2006, Pages

  Altman, Eitan ^a   Barman, Dhiman ^a   Tuffin, Bruno ^b   Vojnović, Milan ^c  

^a INRIA   (France)

^b CAMPUS DE BEAULIEU   (France)

^c MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

MULTIPLICATIVE-DECREASE ADAPTATION; TCP CONGESTION AVOIDANCE MODE;

COMPUTER SIMULATION; DATA TRANSFER; INTERNET; MATHEMATICAL MODELS; SYNCHRONIZATION;

TRANSMISSION CONTROL PROTOCOL;

EID: 39049100396     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2006.104     Document Type: Conference Paper

References (19)

1. http://research.microsoft.com/~milanv/socks.htm.
2. http://www.planet-lab.org.
3. http://dast.nlanr.net/Projects/Iperf/.
4. E. Altman, K. Avrachenkov, and C. Barakat. A stochastic model of tcp/ip with stationary random losses. In Proc. of the Sigcomm'OO, pages 231-242, 2000.
5. E. Altman, R. El Azouzi, D. Ros, and B. Tuffin. Loss Strategies for Competing TCP/IP Connections. In Proc. of the Networking 2004, Athens, Greece, May 2004.
6. E. Altman, D. Barman, B. Tuffin, and M. Vojnović. Parallel tcp sockets: Simple model, throughput and validation. Microsoft Research Technical Report.http://research.microsoft.com/~milanv/TR-2005-130.pdf, 2005.
7. E. Altman, F. Boceara, J. Bolot, P. Nain, P. Brown, D. Collange, and C. Fenzy. Analysis of the tcp/ip flow control mechanism in high-speed wide-area networks. In 34th IEEE Conference on Decision and Control, pages 368-373, New Orleans, Louisiana, Dec 1995.
8. G. Appenzeller, I. Keslassy, and N. McKeown. Sizing Router Buffers. In Proc. of ACM Sigcomm 2004, Portland, Oregon, USA, Aug/Sept 2004.
9. F. Baccelli and D. Hong. AIMD, Fairness and Fractal Scaling of TCP Traffic. In Proc. of IEEE Infocom 2002, New York, NY, http://www.di.ens.fr/~trec/aimd, 2002.
10. J. Crowcroft and P. Oechslin. Differentiated End-to-End Internet Services using a Weighted Proportional Fair Sharing TCP. ACM Computer Communications Review, 47(4):275-303, 2004.
11. S. Floyd and K. Fall. Promoting the use of end-to-end congestion control in the Internet. IEEE/ACM Trans, on Networking, 7(4):458-472, August 1999.
12. S. Floyd and Van Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Trans, on Networking, 1(4):397-413, August 1993.
13. T. Hacker, B. Athey, and B. Noble. The end-to-end performance effects of parallel TCP sockets on a lossy wide-area network. In 16th IEEE-CS/ACM International Parallel and Distributed Processing Symposium, Ft. Lauderdale, FL, April 2002.
14. Van Jacobson and M.J. Karels. Congestion avoidance and control. In Proc. of the ACM SIGCOMM'88, pages 314-329, Stanford, August 1988.
15. T. Kelly. Scalable TCP Improving Performance in Highspeed Wide Area Networks. In PFLDNet'03, Geneve, Switzerland, February 2003.
16. R. El Khoury and E. Altman. Analysis of Scalable TCP. In In Proc. of Het-Nets'04, West Yorkshire, United Kingdom, July 2004.
17. Dong Lu, Yi Qiao, Peter Dinda, and Fabian Bustamante. Modeling and Taming Parallel TCP on the Wide Area Network. In In Proceedings of the 19th IEEE IPDPS '05, Denver, Colorado, April 2005.
18. J. Mahdavi and S. Floyd. TCP-Friendly Unicast Rate-Based Flow Control. Technical note sent to end-2-end interest mailing list, http://www.psc.edu/ networking/papers/tcp.friendly.html, January 1997.
19. J. Padhye, V. Firoiu, D. Towsley, and J. Kurose. Modeling TCP Reno Performance: A Simple Model and its Empirical Validation. IEEE/ACM Trans, on Networking, 8(2): 133-145, 2000.