TCP拥塞控制算法慢启动，拥塞避免，快速重传，快速恢复_快速重传 - CSDN文库

需积分: 45 96 浏览量更新于2023-05-24 评论 2 收藏 8KB PDF 举报

身份认证购VIP最低享 7 折!

领优惠券(最高得80元）

资源详情

资源评论

资源推荐

Network Working Group W. Stevens

Request for Comments: 2001 NOAO

Category: Standards Track January 1997

TCP Slow Start, Congestion Avoidance,

Fast Retransmit, and Fast Recovery Algorithms

Status of this Memo

This document specifies an Internet standards track protocol for the

Internet community, and requests discussion and suggestions for

improvements. Please refer to the current edition of the "Internet

Official Protocol Standards" (STD 1) for the standardization state

and status of this protocol. Distribution of this memo is unlimited.

Abstract

Modern implementations of TCP contain four intertwined algorithms

that have never been fully documented as Internet standards: slow

start, congestion avoidance, fast retransmit, and fast recovery. [2]

and [3] provide some details on these algorithms, [4] provides

examples of the algorithms in action, and [5] provides the source

code for the 4.4BSD implementation. RFC 1122 requires that a TCP

must implement slow start and congestion avoidance (Section 4.2.2.15

of [1]), citing [2] as the reference, but fast retransmit and fast

recovery were implemented after RFC 1122. The purpose of this

document is to document these four algorithms for the Internet.

Acknowledgments

Much of this memo is taken from "TCP/IP Illustrated, Volume 1: The

Protocols" by W. Richard Stevens (Addison-Wesley, 1994) and "TCP/IP

Illustrated, Volume 2: The Implementation" by Gary R. Wright and W.

Richard Stevens (Addison-Wesley, 1995). This material is used with

the permission of Addison-Wesley. The four algorithms that are

described were developed by Van Jacobson.

1. Slow Start

Old TCPs would start a connection with the sender injecting multiple

segments into the network, up to the window size advertised by the

receiver. While this is OK when the two hosts are on the same LAN,

if there are routers and slower links between the sender and the

receiver, problems can arise. Some intermediate router must queue

the packets, and it’s possible for that router to run out of space.

[2] shows how this naive approach can reduce the throughput of a TCP

connection drastically.

Stevens Standards Track [Page 1]

本内容试读结束，登录后可阅读更多

下载后可阅读完整内容，剩余5页未读，立即下载

评论0

pfeiKing

粉丝: 126
资源: 6

会员权益专享

图片转文字

全年可省5，000元立即开通

最新资源

资源上传下载、课程学习等过程中有任何疑问或建议，欢迎提出宝贵意见哦~我们会及时处理！点击此处反馈