Today, the large packet buffers present in backbone routers significantly increase their power consumption and design time. Recent models of networks with large buffers have suggested that these large buffers could be replaced with much smaller ones. Unfortunately, it turns out that these models are not valid anymore in networks with small buffers, and therefore cannot predict how these small-buffer networks will behave. In this paper, we introduce a new model that provides a complete statistical description of small-buffer Internet networks. First, we present novel models of the distributions of several network components, such as the line occupancies of each flow, the instantaneous arrival rates to the bottleneck queues, and the bottleneck queue sizes. Then, we combine all these models in a single fixed-point algorithm that forms the key to the global statistical small-buffer network model. In particular, given some QoS requirements, this new model can be used to precisely size small buffers in backbone router designs.


Small-Buffer Network Network Model Backbone Routers 


  1. 1.
    McKeown, N.: Sizing router buffers. EE384Y Course Talk, Stanford (2006)Google Scholar
  2. 2.
    Shrimali, G., Keslassy, I., McKeown, N.: Designing packet buffers with statistical guarantees. In: IEEE Hot Interconnects XII, Stanford, CA (2004)Google Scholar
  3. 3.
    Villamizar, C., Song, C.: High performance tcp in ansnet. ACM Computer Communications Review (1994)Google Scholar
  4. 4.
    Appenzeller, G., Keslassy, I., McKeown, N.: Sizing router buffers. In: ACM SIGCOMM, Portland, OR (2004)Google Scholar
  5. 5.
    Appenzeller, G., McKeown, N., Sommers, J., Barford, P.: Recent results on sizing router buffers. In: Network Systems Design Conference, San Jose, CA (2004)Google Scholar
  6. 6.
    Enachescu, M., Ganjali, Y., Goel, A., McKeown, N., Roughgarden, T.: Routers with very small buffers. In: IEEE Infocom, Barcelona, Spain (2006)Google Scholar
  7. 7.
    Raina, G., Towsley, D., Wischik, D.: Part II: control theory for buffer sizing. ACM Computer Communications Review (2005)Google Scholar
  8. 8.
    Raina, G., Wischik, D.: Buffer sizes for large multiplexers: TCP queueing theory and instability analysis. In: EuroNGI (2005)Google Scholar
  9. 9.
    Avrachenkov, K.E., Ayesta, U., Altman, E., Nain, P., Barakat, C.: The effect of router buffer size on the TCP performance. In: LONIIS Workshop, St. Petersburg, Russia, pp. 116–121 (2002)Google Scholar
  10. 10.
    Bu, T., Towsley, D.F.: A fixed point approximation of TCP behavior in a network. In: ACM SIGMETRICS (2001)Google Scholar
  11. 11.
    Hespanha, J.P., Bohacek, S., Obraczka, K., Lee, J.: Hybrid modeling of TCP congestion control. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034. Springer, Heidelberg (2001)Google Scholar
  12. 12.
    Shorten, R., Wirth, F., Leith, D.: “A positive systems model of TCP-like congestion control: Asympototic results,” Tech. Rep. 2004-1, Hamilton Institute (2004)Google Scholar
  13. 13.
    Altman, E., Avrachenkov, K.E., Kherani, A.A., Prabhu, B.J.: Performance analysis and stochastic stability of congestion control protocols. In: IEEE Infocom, Miami, FL (2005)Google Scholar
  14. 14.
    Shifrin, M.: The Gaussian nature of TCP in large networks, M.Sc. Research Thesis, Technion, Israel (August 2007),
  15. 15.
    Zabell, S.L.: Alan Turing and the central limit theorem. Amer. Math. Monthly 102, 483–494 (1995)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Tran-Gia, P., Ahmadi, H.: Analysis of a discrete-time G [X]/D/1 − S queueing system with applications in packet-switching systems. In: IEEE Infocom, New Orleans, LA (1988)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2008

Authors and Affiliations

  • Mark Shifrin
    • 1
  • Isaac Keslassy
    • 1
  1. 1.Department of Electrical EngineeringTechnion - Israel Institute of TechnologyHaifaIsrael

Personalised recommendations