1 |
Luigi A. Grieco and Saverio Mascolo, 'Performance Evaluation and Comparison of Westwood+, New Reno, and Vegas TCP Congestion Control', ACM, 2004
DOI
|
2 |
Floyd, S. and T. Henderson, 'The NewReno Modification to TCP's Fast Recovery Algorithm', RFC 2582, April, 1999
|
3 |
Braden, R., 'Requirements for Internet Hosts-Communication Layers', STD 3, RFC 1122, October, 1989
|
4 |
Jacobson, V., 'Congestion Avoidance and Control', Computer Communication Review, Vol.18, No.4, pp.314-329, Aug., 1988
DOI
|
5 |
K. Fall, S. Floyd, 'Simulation based Comparisons of Tahoe, Reno, and SACK TCP', Computer Communications Review, Vol.26, pp.5-21, 1996
DOI
|
6 |
V. Jacobson, R. Braden, D. Borman, 'TCP Extensions for High Performance', RFC 1323, IETF, May, 1992
|
7 |
S. Floyd, J. Mahdavi, M. Mathis, M. Podolsky, 'An Extension to the Selective Acknowledgement(SACK) Option for TCP', RFC 2883, IETF, July, 2000
|
8 |
M. Allman, NASA Glenn, V. Paxson, W. Stevens 'TCP Congestion Control', RFC 2581, IETF, April 1999
|
9 |
Balan, R.K.; Lee, B.P.; Kumar, K.R.R.; Jacob, L.; Seah, W.K.G.; Ananda, A.L. 'TCP HACK: TCP Header Checksum Option to Improve Performance over Lossy Links', lNFOCOM 2001. IEEE, Volume: 1, 22-26 April, 2001 Pages : 309-318 Vol.1
DOI
|
10 |
M. Mathis, J. Mahdavi, S. Floyd, A Romanow, 'TCP selective acknowledgment and options', RFC 2018, IETF, October, 1996
|
11 |
K.N. Srijith, Lillykutty Jacob, A.L. Ananda, 'Worst-Case Performance Limitation of TCP SACK and a Feasible Solution', IEEE Journal on Selected Areas in Communications, 2002
|
12 |
Network Simulator(ns-2), available from http://www.isi.edu/nsnam/ns/
|
13 |
S. Mascolo, C. Casetti, M. Gerla, M. Sanadidi, and R. Wang, 'TCP Westwood: End-to-end bandwidth estimation for efficient transport over wired and wireless networks,' in ACM Mobicom 2001, Rome, Italy, July, 2001
|
14 |
Matthew Mathis, Jamshid Mahdavi, Sally Floyd, and Allyn Romanow. 'TCP Selective Acknowledgment Options,'. (Internet draft, work in progress), 1996
|