메뉴 건너뛰기




Volumn 33, Issue 2, 2003, Pages 51-63

F-RTO: An enhanced recovery algorithm for TCP retransmission timeouts

Author keywords

[No Author keywords available]

Indexed keywords

PACKET LOSSES; RETRANSMISSION TIMEOUTS (RTO); SPURIOUS RETRANSMISSION TIMEOUT; TCP SENDER;

EID: 0842349370     PISSN: 01464833     EISSN: 01464833     Source Type: Conference Proceeding    
DOI: 10.1145/956981.956987     Document Type: Review
Times cited : (77)

References (24)
  • 1
    • 0002441376 scopus 로고    scopus 로고
    • A web server's view of the transport layer
    • October
    • M. Allman. A Web Server's View of the Transport Layer. ACM Computer Communication Review, 30(5), October 2000.
    • (2000) ACM Computer Communication Review , vol.30 , Issue.5
    • Allman, M.1
  • 2
    • 0003219752 scopus 로고    scopus 로고
    • Enhancing TCP's loss recovery using limited transmit
    • January
    • M. Allman, H. Balakrishnan, and S. Floyd. Enhancing TCP's Loss Recovery Using Limited Transmit. RFC 3042, January 2001.
    • (2001) RFC , vol.3042
    • Allman, M.1    Balakrishnan, H.2    Floyd, S.3
  • 3
    • 85013946135 scopus 로고    scopus 로고
    • On estimating end-to-end network path properties
    • September
    • M. Allman and V. Paxson. On Estimating End-to-End Network Path Properties. In Proceedings of ACM SIGCOMM '99, September 1999.
    • (1999) Proceedings of ACM SIGCOMM '99
    • Allman, M.1    Paxson, V.2
  • 4
    • 0003336357 scopus 로고    scopus 로고
    • TCP congestion control
    • April
    • M. Allman, V. Paxson, and W. Stevens. TCP Congestion Control. RFC 2581, April 1999.
    • (1999) RFC , vol.2581
    • Allman, M.1    Paxson, V.2    Stevens, W.3
  • 5
    • 33645779277 scopus 로고    scopus 로고
    • On making TCP more robust to packet reordering
    • January
    • E. Blanton and M. Allman. On Making TCP More Robust to Packet Reordering. ACM Computer Communication Review, 32(1), January 2002.
    • (2002) ACM Computer Communication Review , vol.32 , Issue.1
    • Blanton, E.1    Allman, M.2
  • 6
    • 4544308372 scopus 로고    scopus 로고
    • A conservative Selective Acknowledgement (SACK)-based loss recovery algorithm for TCP
    • April
    • E. Blanton, M. Allman, K. Fall, and L. Wang. A Conservative Selective Acknowledgement (SACK)-based Loss Recovery Algorithm for TCP. RFC 3517, April 2003.
    • (2003) RFC , vol.3517
    • Blanton, E.1    Allman, M.2    Fall, K.3    Wang, L.4
  • 7
    • 0003234343 scopus 로고
    • TCP extensions for high performance
    • May
    • D. Borman, R. Braden, and V. Jacobson. TCP Extensions for High Performance. RFC 1323, May 1992.
    • (1992) RFC , vol.1323
    • Borman, D.1    Braden, R.2    Jacobson, V.3
  • 8
    • 0031245102 scopus 로고    scopus 로고
    • General packet radio service in GSM
    • October
    • J. Cai and D. J. Goodman. General packet radio service in GSM. IEEE Communications Magazine, pages 122-131, October 1997.
    • (1997) IEEE Communications Magazine , pp. 122-131
    • Cai, J.1    Goodman, D.J.2
  • 9
    • 0003358898 scopus 로고    scopus 로고
    • IP header compression
    • February
    • M. Degermark, B. Nordgren, and S. Pink. IP Header Compression. RFC 2507, February 1999.
    • (1999) RFC , vol.2507
    • Degermark, M.1    Nordgren, B.2    Pink, S.3
  • 10
    • 0003214471 scopus 로고    scopus 로고
    • The newreno modification to TCP's fast recovery algorithm
    • April
    • S. Floyd and T. Henderson. The NewReno Modification to TCP's Fast Recovery Algorithm. RFC 2582, April 1999.
    • (1999) RFC , vol.2582
    • Floyd, S.1    Henderson, T.2
  • 11
    • 0842284493 scopus 로고    scopus 로고
    • An extension to the Selective Acknowledgment (SACK) option for TCP
    • July
    • S. Floyd, J. Mahdavi, M. Mathis, and M. Podolsky. An Extension to the Selective Acknowledgment (SACK) Option for TCP. RFC 2883, July 2000.
    • (2000) RFC , vol.2883
    • Floyd, S.1    Mahdavi, J.2    Mathis, M.3    Podolsky, M.4
  • 14
    • 0003256539 scopus 로고
    • Compressing TCP/IP headers for low-speed serial links
    • February
    • V. Jacobson. Compressing TCP/IP headers for low-speed serial links. RFC 1144, February 1990.
    • (1990) RFC , vol.1144
    • Jacobson, V.1
  • 17
    • 0035790161 scopus 로고    scopus 로고
    • A Markov-based channel model algorithm for wireless networks
    • Rome, Italy, July
    • A. Konrad, B.Y. Zhao, A. Joseph, and R. Ludwig. A Markov-Based Channel Model Algorithm for Wireless Networks. In Proceedings of ACM MSWiM 2001, pages 28-36, Rome, Italy, July 2001.
    • (2001) Proceedings of ACM MSWiM 2001 , pp. 28-36
    • Konrad, A.1    Zhao, B.Y.2    Joseph, A.3    Ludwig, R.4
  • 18
    • 0141700956 scopus 로고    scopus 로고
    • The Eifel algorithm: Making TCP robust against spurious retransmissions
    • January
    • R. Ludwig and R. H. Katz. The Eifel Algorithm: Making TCP Robust Against Spurious Retransmissions. ACM Computer Communication Review, 30(1), January 2000.
    • (2000) ACM Computer Communication Review , vol.30 , Issue.1
    • Ludwig, R.1    Katz, R.H.2
  • 20
    • 0003243896 scopus 로고    scopus 로고
    • TCP selective acknowledgement options
    • October
    • M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow. TCP Selective Acknowledgement Options. RFC 2018, October 1996.
    • (1996) RFC , vol.2018
    • Mathis, M.1    Mahdavi, J.2    Floyd, S.3    Romanow, A.4
  • 22
    • 0003273441 scopus 로고    scopus 로고
    • Computing TCP's retransmission timer
    • November
    • V. Paxson and M. Allman. Computing TCP's Retransmission Timer. RFC 2988, November 2000.
    • (2000) RFC , vol.2988
    • Paxson, V.1    Allman, M.2
  • 23
    • 0003260781 scopus 로고
    • Transmission control protocol
    • September
    • J. Postel. Transmission Control Protocol. RFC 793, September 1981.
    • (1981) RFC , vol.793
    • Postel, J.1


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