Experimental Study of Router Buffer Sizing

被引:0
|
作者
Beheshti, Neda [1 ]
Ganjali, Yashar
Ghobadi, Monia
McKeown, Nick [1 ]
Salmon, Geoff
机构
[1] Stanford Univ, Dept Elect Engn, Stanford, CA 94305 USA
来源
IMC'08: PROCEEDINGS OF THE 2008 ACM SIGCOMM INTERNET MEASUREMENT CONFERENCE | 2008年
关键词
NetFPGA; Network Test-beds; Router Buffer Size; TCP;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
During the past four years, several papers have proposed rules for sizing buffers in Internet core routers. Appenzeller et al. suggest that a link needs a buffer of size O(C/root N), where C is the capacity of the link, and N is the number of flows sharing the link. If correct, buffers could be reduced by 99% in a typical backbone router today without loss in throughput. Enachecsu et al., and Raina et al. suggest that buffers can be reduced even further to 20-50 packets if we are willing to sacrifice a fraction of link capacities, and if there is a large ratio between the speed of core and access links. If correct, this is a five orders of magnitude reduction in buffer sizes. Each proposal is based on theoretical analysis and validated using simulations. Given the potential benefits (and the risk of getting it wrong!) it is worth asking if these results hold in real operational networks. In this paper, we report buffer-sizing experiments performed on real networks - either laboratory networks with commercial routers as well as customized switching and monitoring equipment (UW Madison, Sprint ATL, and University of Toronto), or operational backbone networks (Level 3 Communications backbone network, Internet2, and Stanford). The good news: Subject to the limited scenarios we can create, the buffer sizing results appear to hold. While we are confident that the O(C/root N) will hold quite generally for backbone routers, the 20-50 packet rule should be applied with extra caution to ensure that network components satisfy the underlying assumptions.
引用
收藏
页码:197 / 210
页数:14
相关论文
共 50 条
  • [1] An experimental study of router buffer sizing for mixed TCP and real-time traffic
    Theagarajan, Gajendra Hari Prakash
    Ravichandran, Sivakumar
    Sivaraman, Vijay
    ICON: 2006 IEEE INTERNATIONAL CONFERENCE ON NETWORKS, VOLS 1 AND 2, PROCEEDINGS: NETWORKING -CHALLENGES AND FRONTIERS, 2006, : 204 - +
  • [2] SIZING BUFFER OF ROUTER WITH PACING MECHANISM
    Liu, Xinying
    Wang, Lei
    PROCEEDINGS OF 2011 INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY AND APPLICATION, ICCTA2011, 2011, : 277 - 280
  • [3] Open issues in router buffer sizing
    Dhamdhere, A
    Dovrolis, C
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2006, 36 (01) : 87 - 92
  • [4] Sizing Router Buffer for the Internet with Heterogeneous TCP
    Yang, Peng
    Zhang, Ertong
    Xu, Lisong
    2013 IEEE 32ND INTERNATIONAL PERFORMANCE COMPUTING AND COMMUNICATIONS CONFERENCE (IPCCC), 2013,
  • [5] Perspectives on Router Buffer Sizing: Recent Results and Open Problems
    Vishwanath, Arun
    Sivaraman, Vijay
    Thottan, Marina
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2009, 39 (02) : 34 - 39
  • [6] Some Open Issues and New Progress in the Research of Router Buffer Sizing
    Zhang, Bo
    Yan, Jinyao
    Chen, Zheng
    2014 IEEE SYMPOSIUM ON COMPUTER APPLICATIONS AND COMMUNICATIONS (SCAC), 2014, : 19 - 23
  • [7] Router Buffer Sizing for TCP Traffic and the Role of the Output/Input Capacity Ratio
    Prasad, Ravi S.
    Dovrolis, Constantine
    Thottan, Marina
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2009, 17 (05) : 1645 - 1658
  • [8] Simulation studies on router buffer sizing for short-lived and pacing TCP flows
    Hasegawa, Go
    Tomioka, Takeshi
    Tada, Kentarou
    Murata, Masayuki
    COMPUTER COMMUNICATIONS, 2008, 31 (16) : 3789 - 3798
  • [9] Sizing router buffers
    Appenzeller, G
    Keslassy, I
    McKeown, N
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2004, 34 (04) : 281 - 292
  • [10] Sizing Router Buffers (Redux)
    McKeown, Nick
    Appenzeller, Guido
    Keslassy, Isaac
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2019, 49 (05) : 69 - 74