| 摘要: |
| 针对流竞争拥塞,提出了一种拥塞分析模型FCCM(flow-competing congestion model),给出了TCP竞争流在拥塞链路上的分布特性,推导了流竞争拥塞发生的条件,进而分析了在流竞争拥塞发生时,路由器为维持拥塞链路100%利用率所需的最小缓存.分析结果表明,当流数目不确定时,应对流竞争拥塞所需的缓存将不大于流数目确定时经典BSCL(buffer sizing for congested internet links)方案中的最小缓存需求. |
| 关键词: TCP流 流竞争拥塞 缓存需求 竞争流 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National High-Tech Research and Development Plan of China under Grant No.2005AA121210 (国家高技术研究发展计划(863)); the National Basic Research Program of China under Grant No.2007CB307102 (国家重点基础研究发展计划(973)) |
|
| Study on TCP Flow-Competing Congestion and Buffer Requirement of the Congested Links |
|
LI Yu-Feng,QIU Han,LAN Ju-Long,WANG Bin-Qiang
|
| Abstract: |
| This paper first presents an analysis model named flow-competing congestion model (FCCM) for this type of congestion. Based on FCCM, the paper derives the distribution of competing flows at the congested link, and analyzes the conditions under which the flow-competing congestion would happen. This paper also explores how much buffers a congested link requires to keep full link utilization when the flow-competing congestion occurs. This paper proves that when sizing buffers for a congested internet link with the aim of keeping full link utilization, the buffer requirement of the flow-competing congestion is not bigger than the minimum buffer requirement of the famous BSCL (buffer sizing for congested internet links) scheme. |
| Key words: TCP flow flow-competing congestion buffer requirement competing flow |
