Skip to main content
SpringerLink
Log in

Dynamic Internet Congestion with Bursts

  • Conference paper
High Performance Computing - HiPC 2006 (HiPC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4297))

Included in the following conference series:

Abstract

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.

Research supported by the Swiss National Science Foundation.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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. 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. 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. 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)

    Article  Google Scholar 

  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. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

  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. Feigenbaum, J., Papadimitriou, C.H., Shenker, S.: Sharing the Cost of Multicast Transmissions. Journal of Computer and System Sciences 63(1), 21–41 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  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. 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. 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. Kelly, F.: Mathematical Modelling of the Internet. In: Bjorn Engquist and Wilfried Schmid: Mathematics Unlimited. Springer, Heidelberg (2001)

    Google Scholar 

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

    Article  Google Scholar 

  14. Le Boudec, J.-Y., Thiran, P.: Network Calculus. LNCS, vol. 2050. Springer, Heidelberg (2001)

    Book  MATH  Google Scholar 

  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. Rosén, A.: A Note on Models for Non-Probabilistic Analysis of Packet Switching Networks. Inf. Process. Lett. 84(5), 237–240 (2002)

    MATH  Google Scholar 

  17. Stevens, R., Wright, G.R.: TCP/IP Illustrated (The Implementation), vol. 2. Addison-Wesley, Reading (1995)

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Computer Engineering and Networks Laboratory (TIK), ETH Zurich, CH-8092, Zurich, Switzerland

    Stefan Schmid & Roger Wattenhofer

Authors
  1. Stefan Schmid
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roger Wattenhofer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1.  ,  

    Yves Robert

  2. Department of Electrical and Computer Engineering, Rutgers, the State University of New Jersey, 94 Brett Road, NJ 08854, Piscataway, USA

    Manish Parashar

  3. Hewlett-Packard ISO, Sy 192, Whitefield Road, Mahadevapura Post, 560048, Bangalore, India

    Ramamurthy Badrinath

  4. Department of Electrical Engineering, University of Southern California, 90089-2562, Los Angeles, CA, USA

    Viktor K. Prasanna

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schmid, S., Wattenhofer, R. (2006). Dynamic Internet Congestion with Bursts. In: Robert, Y., Parashar, M., Badrinath, R., Prasanna, V.K. (eds) High Performance Computing - HiPC 2006. HiPC 2006. Lecture Notes in Computer Science, vol 4297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11945918_20

Download citation

  • DOI: https://doi.org/10.1007/11945918_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68039-0

  • Online ISBN: 978-3-540-68040-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation