Dynamic Internet Congestion with Bursts

  • Stefan Schmid
  • Roger Wattenhofer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4297)


This paper studies throughput maximization in networks with dynamically changing congestion. First, we give a new and simple analysis of an existing model where the bandwidth available to a flow varies multiplicatively over time. The main contribution however is the introduction of a novel model for dynamics based on concepts of network calculus. This model features a limited form of amortization: After quiet times where the available bandwidth was roughly constant, the congestion may change more abruptly. We present a competitive algorithm for this model and also derive a lower bound.


Congestion Control Competitive Ratio Online Algorithm Transport Layer Arrival Curve 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aiello, W., Kushilevitz, E., Ostrovsky, R., Rosén, A.: Adaptive Packet Routing for Bursty Adversarial Traffic. In: Proceedings of the 13th Annual ACM Symposium on Theory of Computing (STOC), New York, USA, pp. 359–368 (1998)Google Scholar
  2. 2.
    Aldous, D.: Ultimate Instability of Exponential Back-off Protocol for Acknowledgement Based Transmission Control of Random Access Communication Channels. IEEE Transactions on Information Theory (1987)Google Scholar
  3. 3.
    Andrews, M., Awerbuch, B., Fernández, A., Leighton, T., Liu, Z., Kleinberg, J.: Universal-Stability Results and Performance Bounds for Greedy Contention-Resolution Protocols. Jounal of the ACM 48(1), 39–69 (2001)CrossRefGoogle Scholar
  4. 4.
    Arora, S., Brinkman, B.: A Randomized Online Algorithm for Bandwidth Utilization. In: Proceedings of the 13th Annual ACM Symposium on Discrete Algorithms (SODA), Philadelphia, PA, USA, pp. 535–539 (2002)Google Scholar
  5. 5.
    Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)MATHGoogle Scholar
  6. 6.
    Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial Queuing Theory. In: Proceedings of the 28th Annual Symposium on Foundations of Computer Science (STOC) (1996)Google Scholar
  7. 7.
    Feigenbaum, J., Papadimitriou, C.H., Shenker, S.: Sharing the Cost of Multicast Transmissions. Journal of Computer and System Sciences 63(1), 21–41 (2001)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Gummadi, K.P., Madhyastha, H.V., Gribble, S.D., Levy, H.M., Wetherall, D.: Improving the Reliability of Internet Paths with One-hop Source Routing. In: Symposium on Operating Systems Design & Implementation (OSDI) (2004)Google Scholar
  9. 9.
    Karlin, A., Kenyon, C., Randall, D.: Dynamic TCP Acknowledgement and Other Stories about e/(e − 1). In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science (STOC) (2001)Google Scholar
  10. 10.
    Karp, R.M., Koutsoupias, E., Papadimitriou, C.H., Shenker, S.: Optimization Problems in Congestion Control. In: Proceedings of Symposium on Foundations of Computer Science (FOCS), pp. 66–74 (2000)Google Scholar
  11. 11.
    Kelly, F.: Mathematical Modelling of the Internet. In: Bjorn Engquist and Wilfried Schmid: Mathematics Unlimited. Springer, Heidelberg (2001)Google Scholar
  12. 12.
    Kelly, F., Maulloo, A., Tan, D.: Rate Control in Communication Networks: Shadow Prices, Proportional Fairness and Stability. Journal of the Operational Research Society 49 (1998)Google Scholar
  13. 13.
    Lakshman, T.V., Madhow, U.: The Performance of TCP/IP for Networks with High Bandwidth-Delay Products and Random Loss. IEEE/ACM Transactions on Networking 5(3), 336–350 (1997)CrossRefGoogle Scholar
  14. 14.
    Le Boudec, J.-Y., Thiran, P.: Network Calculus. LNCS, vol. 2050. Springer, Heidelberg (2001)MATHCrossRefGoogle Scholar
  15. 15.
    Leighton, F., Maggs, B., Rao, S.: Universal Packet Routing Algorithms. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 256–269 (1988)Google Scholar
  16. 16.
    Rosén, A.: A Note on Models for Non-Probabilistic Analysis of Packet Switching Networks. Inf. Process. Lett. 84(5), 237–240 (2002)MATHGoogle Scholar
  17. 17.
    Stevens, R., Wright, G.R.: TCP/IP Illustrated (The Implementation), vol. 2. Addison-Wesley, Reading (1995)Google Scholar
  18. 18.
    Willinger, W., Leland, W., Taqqu, M., Wilson, D.: On the Self-Similar Nature of Ethernet Traffic. IEEE/ACM Transactions on Networking, 1–15 (1994)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Stefan Schmid
    • 1
  • Roger Wattenhofer
    • 1
  1. 1.Computer Engineering and Networks Laboratory (TIK)ETH ZurichZurichSwitzerland

Personalised recommendations