Study on TCP Flow-Competing Congestion and Buffer Requirement of the Congested Links
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

李玉峰,邱 菡,兰巨龙,汪斌强. TCP流竞争拥塞及拥塞链路的缓存需求研究.软件学报,2008,19(6):1499-1507

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 20,2006
  • Revised:February 08,2007
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063