메뉴 건너뛰기




Volumn , Issue , 2011, Pages 155-169

Proportional rate reduction for TCP

Author keywords

early re transmit; fast recovery; proportional rate reduction; retransmission statistics; TCP

Indexed keywords

EARLY RE-TRANSMIT; FAST RECOVERY; PROPORTIONAL RATE REDUCTION; RETRANSMISSIONS; TCP;

EID: 82955165677     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2068816.2068832     Document Type: Conference Paper
Times cited : (45)

References (29)
  • 1
    • 84878675821 scopus 로고    scopus 로고
    • State of the internet, 2010. http://www.akamai.com/stateoftheinternet/.
    • (2010) State of the Internet
  • 3
    • 0003219752 scopus 로고    scopus 로고
    • Enhancing TCP's loss recovery using limited transmit
    • January
    • ALLMAN, M., BALAKRISHNAN, H., AND FLOYD, S. Enhancing TCP's loss recovery using limited transmit, January 2001. RFC 3042.
    • (2001) RFC , vol.3042
    • Allman, M.1    Balakrishnan, H.2    Floyd, S.3
  • 4
    • 77954396240 scopus 로고    scopus 로고
    • TCP congestion control
    • September
    • ALLMAN, M., PAXSON, V., AND BLANTON, E. TCP congestion control, September 2009. RFC 5681.
    • (2009) RFC , vol.5681
    • Allman, M.1    Paxson, V.2    Blanton, E.3
  • 7
    • 47849111956 scopus 로고    scopus 로고
    • Using TCP DSACKs and SCTP duplicate TSNs to detect spurious retransmissions
    • February
    • BLANTON, E., AND ALLMAN, M. Using TCP DSACKs and SCTP duplicate TSNs to detect spurious retransmissions, February 2004. RFC 3708.
    • (2004) RFC , vol.3708
    • Blanton, E.1    Allman, M.2
  • 8
    • 4744343352 scopus 로고    scopus 로고
    • A conservative SACK-based loss recovery algorithm for TCP
    • BLANTON, E., ALLMAN, M., FALL, K., AND WANG, L. A conservative SACK-based loss recovery algorithm for TCP, 2003. RFC 3517.
    • (2003) RFC , vol.3517
    • Blanton, E.1    Allman, M.2    Fall, K.3    Wang, L.4
  • 9
    • 0011999293 scopus 로고    scopus 로고
    • An extension to the SACK option for TCP
    • July
    • FLOYD, S., MAHDAVI, J., MATHIS, M., AND PODOLSKY, M. An extension to the SACK option for TCP, July 2000. RFC 2883.
    • (2000) RFC , vol.2883
    • Floyd, S.1    Mahdavi, J.2    Mathis, M.3    Podolsky, M.4
  • 10
    • 70449606648 scopus 로고    scopus 로고
    • CUBIC: A new TCP-friendly high-speed TCP variant
    • July
    • HA, S., RHEE, I., AND XU, L. CUBIC: a new TCP-friendly high-speed TCP variant. SIGOPS Oper. Syst. Rev. 42 (July 2008), 64-74.
    • (2008) SIGOPS Oper. Syst. Rev. , vol.42 , pp. 64-74
    • Ha, S.1    Rhee, I.2    Xu, L.3
  • 11
    • 0030262336 scopus 로고    scopus 로고
    • Improving the start-up behavior of a congestion control scheme for TCP
    • August
    • HOE, J. Improving the start-up behavior of a congestion control scheme for TCP. SIGCOMM Comput. Commun. Rev. (August 1996).
    • (1996) SIGCOMM Comput. Commun. Rev.
    • Hoe, J.1
  • 12
    • 0031675088 scopus 로고    scopus 로고
    • TCP fast recovery strategies: Analysis and improvements
    • LIN, D., AND KUNG, H. TCP fast recovery strategies: Analysis and improvements. In Proc. of INFOCOMM (1998).
    • Proc. of INFOCOMM (1998)
    • Lin, D.1    Kung, H.2
  • 13
    • 0141700956 scopus 로고    scopus 로고
    • The eifel algorithm: Making TCP robust against spurious retransmissions
    • January
    • LUDWIG, R., AND KATZ, R. H. The eifel algorithm: Making TCP robust against spurious retransmissions. (ACM) Computer Communication Review 30 (January 2000).
    • (2000) (ACM) Computer Communication Review , vol.30
    • Ludwig, R.1    Katz, R.H.2
  • 14
    • 3142761797 scopus 로고    scopus 로고
    • The eifel detection algorithm for TCP
    • April
    • LUDWIG, R., AND MEYER, M. The eifel detection algorithm for TCP, April 2003. RFC 3522.
    • (2003) RFC , vol.3522
    • Ludwig, R.1    Meyer, M.2
  • 16
    • 0030259607 scopus 로고    scopus 로고
    • Forward acknowledgment: Refining TCP congestion control
    • August
    • MATHIS, M., AND MAHDAVI, J. Forward acknowledgment: refining TCP congestion control. SIGCOMM Comput. Commun. Rev. 26 (August 1996), 281-291.
    • (1996) SIGCOMM Comput. Commun. Rev. , vol.26 , pp. 281-291
    • Mathis, M.1    Mahdavi, J.2
  • 18
    • 0003243896 scopus 로고    scopus 로고
    • TCP selective acknowledgement options
    • October
    • MATHIS, M., MAHDAVI, J., FLOYD, S., AND ROMANOW, A. TCP selective acknowledgement options, October 1996. RFC 2018.
    • (1996) RFC , vol.2018
    • Mathis, M.1    Mahdavi, J.2    Floyd, S.3    Romanow, A.4
  • 22
    • 42549129631 scopus 로고    scopus 로고
    • Aperformance study of loss detection/recovery in real-world TCP implementations
    • REWASKAR, S., KAUR, J., AND SMITH, F. D. Aperformance study of loss detection/recovery in real-world TCP implementations. In Proc. of ICNP (2007).
    • (2007) Proc. of ICNP
    • Rewaskar, S.1    Kaur, J.2    Smith, F.D.3
  • 24
    • 82955200853 scopus 로고    scopus 로고
    • November Work in progress, draft-scheffenegger-tcpm-sack-loss-recovery- 00.txt.
    • SCHEFFENEGGER, R. Improving SACK-based loss recovery for TCP, November 2010. Work in progress, draft-scheffenegger-tcpm-sack-loss-recovery-00.txt.
    • (2010) Improving SACK-based Loss Recovery for TCP
    • Scheffenegger, R.1
  • 27
    • 0003368629 scopus 로고    scopus 로고
    • TCP control block interdependence
    • April
    • TOUCH, J. TCP control block interdependence, April 1997. RFC 2140.
    • (1997) RFC , vol.2140
    • Touch, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.