loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th IEEE Symposium on Computers and Communications (ISCC'05)
Link Buffer Sizing: A New Look at the Old Problem
Cartagena, Murcia, Spain
June 27-June 30
ISBN: 0-7695-2373-0
Sergey Gorinsky, Washington University in St. Louis
Anshul Kantawala, Washington University in St. Louis
Jonathan Turner, Washington University in St. Louis
We revisit the question of how much buffer an IP router should allocate for its Droptail FIFO link. For a long time, setting the buffer size to the bitrate-delay product has been regarded as reasonable. Recent studies of interaction between queueing at IP routers and TCP congestion control offered alternative guidelines. First, we explore and reconcile contradictions between the existing rules. Then, we argue that the problem of link buffer sizing needs a new formulation: design a buffer sizing algorithm that accommodates needs of all Internet applications without engaging IP routers in any additional signaling. Our solution keeps network queues short: set the buffer size to 2L datagrams, where L is the number of input links. We also explain how end systems can utilize the network effectively despite such small buffering at routers.
Citation:
Sergey Gorinsky, Anshul Kantawala, Jonathan Turner, "Link Buffer Sizing: A New Look at the Old Problem," iscc, pp.507-514, 10th IEEE Symposium on Computers and Communications (ISCC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.