Skip to main content

On the Scalability of Fluid Models of IP Networks Loaded by Long-lived TCP Flows

  • Conference paper
Modeling and Simulation Tools for Emerging Telecommunication Networks

Abstract

Fluid models of IP networks have been recently proposed, to break the scalability barrier of traditional performance evaluation approaches, both simulative (e.g., ns-2) and analytical (e.g., queues and Markov chains). Fluid models adopt a deterministic description of the average source and network dynamics through a set of (coupled) ordinary differential equations that are solved numerically, obtaining estimates of the time-dependent behavior of the IP network.

The most attractive property of fluid models resides in the fact that they are scalable, i.e., their complexity is independent of the number of TCP flows and of link capacities. In this paper we provide a theoretical investigation of the origins of the scalability of fluid models. We show that the set of differential equations defining the network dynamics under both drop-tail and AQM buffering exhibits a nice invariance property, that allows an equivalence relation to be established among different systems. The validity of the invariance property is verified in realistic network scenarios with ns-2 simulations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Baccelli, D. Hong, “Interaction of TCP Flows as Billiards”, IEEE Infocom 2003, San Francisco, CA, March 2003.

    Google Scholar 

  2. F. Baccelli, D. Hong, “Flow Level Simulation of Large IP Networks”, IEEE Infocom 2003, SanFrancisco, CA, March 2003.

    Google Scholar 

  3. S. Misra, W.B. Gong, D. Towsley, “Fluid-Based Analysis of a Network of AQM Routers Supporting TCP Flows with an Application to RED”, ACM SIGCOMM 2000, Stockholm, Sweden, August 2000.

    Google Scholar 

  4. C.V. Hollot, V. Misra, D. Towsley, W.B. Gong, “On the Design of Improved Controllers for AQM Routers Supporting TCP Flows”, IEEE Infocom 2001, Anchorage, Alaska, USA, April 2001.

    Google Scholar 

  5. Y. Liu, F.Lo Presti, V. Misra, D. Towsley, “Fluid Models and Solutions for Large-Scale IP Networks”, ACM Sigmetrics 2003, San Diego, CA, June 2003.

    Google Scholar 

  6. C.V. Hollot, V. Misra, D. Towsley, W.B. Gong, “A Control Theoretic Analysis of RED”, IEEE Infocom 2001, Anchorage, Alaska, USA, April 2001.

    Google Scholar 

  7. S. Deb, S. Shakkottai, R. Srikant, “Stability and Convergence of TCP-like Congestion Controllers in a Many-Flows Regime”, IEEE Infocom 2003, San Francisco, CA, March 2003.

    Google Scholar 

  8. S. Shakkottai, R. Srikant, “How Good are Deterministic FluidModels of Internet Congestion Control?” IEEE INFOCOM 2002, New York, June 2002.

    Google Scholar 

  9. P. Tinnakornsrisuphap, A. Makowski, “Limit Behavior of ECN/RED Gateways Under a Large Number of TCP Flows”, IEEE Infocom 2003, San Francisco, CA, March 2003.

    Google Scholar 

  10. F. Baccelli, D.R. McDonald, J. Reynier, “A Mean-Field Model for Multiple TCP Connections through a Buffer Implementing RED”, Performance Evaluation, vol. 49 n. 1/4, pp. 77–97, 2002.

    Article  MATH  Google Scholar 

  11. M. Ajmone Marsan, M. Garetto, P. Giaccone, E. Leonardi, E. Schiattarella, A. Tarello, “Using Partial Differential Equations to Model TCP Mice and Elephants in Large IP Networks”, Infocom 2004, Hong Kong, March 2004.

    Google Scholar 

  12. M. Ajmone Marsan, G. Carofiglio, M. Garetto, P. Giaccone, E. Leonardi, E. Schiattarella, A. Tarello, “Of Mice and Models”, QoS IP 2005, Catania, February 2005.

    Google Scholar 

  13. S. Floyd, V. Jacobson, “Random Early Detection Gateways for Congestion Avoidance”, IEEE/ACM Transactions on Networking, vol. 1, n. 4, pp. 397–413, August 1993.

    Article  Google Scholar 

  14. R. Pan, B. Prabhakar, K. Psounis, D. Wischik, “SHRiNK: A method for scalable performance prediction and efficient network simulation”, IEEE Infocom 2003, San Francisco, CA, March 2003

    Google Scholar 

  15. R. Pan, B. Prabhakar, K. Psounis, M. Sharma, “A study of the applicability of a scaling hypothesis”, in Proc. ASCC 2002, Singapore, September 2002

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, LLC

About this paper

Cite this paper

Marsan, M.A. et al. (2006). On the Scalability of Fluid Models of IP Networks Loaded by Long-lived TCP Flows. In: Nejat Ince, A., Topuz, E. (eds) Modeling and Simulation Tools for Emerging Telecommunication Networks. Springer, Boston, MA . https://doi.org/10.1007/0-387-34167-6_6

Download citation

  • DOI: https://doi.org/10.1007/0-387-34167-6_6

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-32921-5

  • Online ISBN: 978-0-387-34167-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics