路由器缓存需求
作者:
基金项目:

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))

  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [40]
  • |
  • 相似文献 [20]
  • |
  • 引证文献
  • | |
  • 文章评论
    摘要:

    综述了路由器缓存的作用.基于随机服务理论,分析了长相关流量模型和短相关流量模型输入路由器系统时的各种缓存分析结论,着重论述了基于TCP协议模型的各种最新缓存需求研究成果,包括经验法则、小缓存法则、基于丢包率的缓存法则和极小缓存法则.总结了以往缓存研究的不足,并提出了下一步的研究方向.

    Abstract:

    A brief summary of the effect of router buffers on network performance is presented. The previous buffer sizing works based on queuing theory are analyzed under two classes of traffic models, the models exhibiting long-range dependence and the models exhibiting short-range dependence. Another type of buffer sizing works are based on TCP models, and the rule of thumb, the small buffers rule, the drop-based buffers rule and the tiny buffers rule are the four main recent results in these works. The results of the four rules and some preliminary experiments to validate these rules are carefully summarized. Research directions and open problems are also discussed.

    参考文献
    [1]Bradner S.Benchmarking terminology for network interconneetion devices.RFC 1242,1991.http://www.ietf.org/rfc/rfc1242.txt
    [2]Bradner S,McQuaid J.Benchmarking methodology for network interconnect devices.RFC 2544,1999.http://www.ietf.org/rfc/rfc2544.txt
    [3]Dhamdhere A,Dovrolis C.Open issues in router buffer sizing.ACM SIGCOMM Computer Communications Review,2006,36(1):87-92.
    [4]Wischik D.Buffer requirements for high-speed ronters.In:Proc,of the ECOC 2005.2005.23-26.http://www.cs.ucl.ac.uk/staff/D.Wischik/Research/
    [5]Zhao Z,Darbha S,Reddy ALN.A method for estimating the proportion of nonresponsive traffic at a route.IEEE/ACM Trans.on Networking,2004,12(4):708-718.
    [6]Erramilli A,Narayan O,Willinger W.Experimental queueing analysis with long-range dependent packet traffic.IEEE/ACM Trans.on Networking,1996,4(2):209-223.
    [7]Leland WE,Taqqu MS,Willinger W,Wilson DV.On the self-similar nature of Ethemet traffic(extended version).IEEE/ACM Trans.on Networking,1994,2(1):1-15.
    [8]Jin ZG,Y JS,Wang JD,Shu YT.Sampling of important events in performance evaluation of networks.Journal of Tianjin University,2001,34(6):738-740(in Chinese with English abstract).
    [9]Huang C,et al.Fast simulation of self-similar traffic in ATM networks,in:Proc.of the ICC'95.1995.438-444.
    [10]Neidhardt AL,Wang JL.The concept of relevant time scales and its application to queuing analysis of self-similar traffic(or is hurst naughty or nice?).In:Proc.of the ACM SIGMETRICS 1998.1998.222-232.
    [11]Likhanov N,Tsybakov B,Georganas ND.Analysis of an ATM buffer with self-similar("Fractal")input traffic.In:Proc.of the IEEE INFOCOM'95.Washington:IEEE Computer Society,1995.985-992.
    [12]Norros I.On the use of fractional Brownian motion in the theory of counectionless networks.IEEE Journal on Selected Areas in Communication,1995,13(6):953-962.
    [13]Norros I.A storage model with self-similar input.Queueing Systems,1994,16:387-396.
    [14]Duffield ND,O'Connell N.Large deviations and overflow probabilities for the general single-server queue,with application.In:Proc.of the Cambridge Philosophy Society.1995.363-375.http://www.research.att.com/~duffield/papers/
    [15]Rananund N.Upper-Bounds for tail probability of a queue with Long-range dependent input.In:Proc.of the ICC'98.IEEE Press,1998.1466-1472.
    [16]Erramilli A,Singh PR,Pruthi P.An approach of deterministic chaotic maps to model packet traffic.Queuing System,1995,17:171-206.
    [17]Pruthi P,Erramilli A.Heavy-Tailed ON/OFF source behavior and self-similar traffic.In:Proc.of the ICC'95.1995.445-450.
    [18]Rao YH.Self-Similar network traffic and performance of high-speed routing structure[Ph.D.Thesis].Wuhan:Huazhong University of Science and Technology,2004(in Chinese with English abstract).
    [19]VilIamizar C,Song C.High performance TCP in ANSNET.ACM Computer Communication Review,1994,24(5):45-60.
    [20]Bush R,Meyer D.Some Internet architectural guidelines and philosophy.RFC 3439,2002.http://www.rfc-archive.org/getrfc.php?rfc=3439
    [21]Fraleigh CJ.Provisioning Internet backbone networks to support latency sensitive applications[Ph.D.Thesis].Palo Alto:Stanford University,2002.
    [22]Appenzeller G,Keslassy I,MaKeown N.Sizing router buffers.In:Proc.of the SICJCOMM 2004.New York:ACM Press,2004.281-292.
    [23]Ganjali Y,McKeown N.Update on buffer sizing in Internet routers.Computer Communications Review,2006,36(5):67-70.
    [24]Raina G,Wischik D.Buffer sizes for large multiplexers:TCP queueing theory and instability analysis.In:Proc.of the EuroNGLRome,2005.173-180.http://www.cs.ucl.ac.uk/staff/d.wischik/Research/tcptheory.html.
    [25]Morris R.Scalable TCP congestion control.In:Proc.of the IEEE INFOCOM 2000.2000.1176-1183.
    [26]Dhamdhere,Jiang H,Dovrolis C.Buffering sizing for congested Internet links.In:Proc.of the IEEE INFOCOM 2005.2005.1072-1083.http://www.cc.gatech.edu/~amogh/buffers.pdf
    [27]Enachesen M,Ganjali Y,Goel A,McKeown N,Roughgarden T.Routers with very small buffers.In:Proc.of the IEEE INFOCOM 2006.2006.
    [28]Aggarwal A,Savage S,Anderson T.Understanding the performance of TCP pacing.In:Proc.of the IEEE INFOCOM.2000.1157-1165.http://www.cs.acsd.edu/~savage/papers/Infocom2000pacing.pdf
    [29]Park H,Burmeister EF,Bjorlin S,et al.40-Gb/s optical buffer design and simulations.In:Proc.of the Numerical Simulation of Optoelectonic Devices(NUSOD).2004.9-20.
    [30]Odlyzko AM.The current state and likely evolution of the Internet.In:Proc.of the IEEE GLOBECOM'99.IEEE,1999.1869-1875.
    [31]Odlyzko AM.Data networks are lightly utilized,and will stay that way.Review of Network Economics,2003,2(3):210-237.
    [32]Beheshti N,Ganjali Y,Rajaduray R,Blumenthal D,McKeown N.Buffer sizing in all-optical packet switches.In:Proc.of the OFC/NFOEC.2006.http://yuba.stanford.edu/buffersizing/
    [33]Hohn N,Veitch D,Papagiaunaki K,Diot C.Bridging router performance and queuing theory.In:Proc.of the SIGMETRICS.New York:ACM Press,2004.355-366.
    [34]Appenzeller G.Sizing router buffers[Ph.D.Thesis].Stanford University,2004.
    [35]Shah D,Iyer S,Prabhakar B,McKeown N.Maintaining statistics counters in router line cards.IEEE Micro,2002,22(1):76-81.
    [36]Iyer S,Zhang R,McKeown N.Routers with a single stage of buffering.In:Proc.of the ACM SIGCOMM.Pittsburgh,2002.Computer Communication Review,2002.431-439.
    [37]Iyer S,Kompella RR,McKeown N.Techniques for fast packet buffers.Technical Report,TR01-HPNG-081501,Stanford University,2001.
    [38]Sailesh K,Venkatesh R,Philip J,Shukla S.Implementing parallel packet buffering:Part 1.In:Proe.of the Commsdesign.2002.http://www.commsdesign.com/story/OEG20020422S0006
    [39]lyer S,Kompella RR,McKeown N.Analysis of a memory architecture for fast packet buffers.In:Proc.of the IEEE High Performance Switching and Routing.2001.368-373.
    [40]Wang P,Yi P,Jin DP,Zeng LG.Buffering high-speed packets with tri-stage memory array and its performance analysis.Journal of Software,2005,16(12):2181-2189(in Chinese with English abstract).http://www.jos.org.cn/1000-9825/16/2181.htm
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

李玉峰,邱 菡,兰巨龙,汪斌强.路由器缓存需求.软件学报,2008,19(3):733-743

复制
分享
文章指标
  • 点击次数:7878
  • 下载次数: 10767
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2007-06-19
  • 最后修改日期:2007-09-04
文章二维码
您是第19793841位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号