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 条
  • [21] The effects of fairness in buffer sizing
    Wang, Mei
    Ganjali, Yashar
    NETWORKING 2007: AD HOC AND SENSOR NETWORKS, WIRELESS NETWORKS, NEXT GENERATION INTERNET, PROCEEDINGS, 2007, 4479 : 867 - +
  • [22] Buffer sizing for elastic traffic
    Auge, Jordan
    Roberts, James
    2006 2nd Conference on Next Generation Internet Design and Engineering, 2006, : 33 - 40
  • [23] Router with Centralized Buffer for Network-on-Chip
    Wang, Ling
    Zhang, Jianwen
    Yang, Xiaoqing
    Wen, Dongxin
    GLSVLSI 2009: PROCEEDINGS OF THE 2009 GREAT LAKES SYMPOSIUM ON VLSI, 2009, : 469 - 474
  • [24] Centralized Buffer Router: A Low Latency, Low Power Router for High Radix NOCs
    Hassan, Syed Minhaj
    Yalamanchili, Sudhakar
    2013 SEVENTH IEEE/ACM INTERNATIONAL SYMPOSIUM ON NETWORKS-ON-CHIP (NOCS 2013), 2013,
  • [25] A Study on the Buffer Sizing Method of CCPM Technique Using Statistical Analysis
    Liu, Jingchao
    Whangbo, Taeg-Keun
    CONVERGENCE AND HYBRID INFORMATION TECHNOLOGY, 2012, 310 : 672 - 679
  • [26] Simulation perspectives on link buffer sizing
    Gorinsky, Sergey
    Kantawala, Anshul
    Turner, Jonathan
    SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL, 2007, 83 (03): : 245 - 257
  • [27] On buffer sizing for voice in 802.11 WLANs
    Malone, David
    Clifford, Peter
    Leith, Douglas J.
    IEEE COMMUNICATIONS LETTERS, 2006, 10 (10) : 701 - 703
  • [28] Buffer sizing of a Heijunka Kanban system
    Judith Matzka
    Maria Di Mascolo
    Kai Furmans
    Journal of Intelligent Manufacturing, 2012, 23 : 49 - 60
  • [29] Buffer sizing for congested Internet links
    Dhamdhere, A
    Hao, J
    Dovrolis, C
    IEEE INFOCOM 2005: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-4, PROCEEDINGS, 2005, : 1072 - 1083
  • [30] Buffer sizing of a Heijunka Kanban system
    Matzka, Judith
    Di Mascolo, Maria
    Furmans, Kai
    JOURNAL OF INTELLIGENT MANUFACTURING, 2012, 23 (01) : 49 - 60