Dynamic Internet Congestion with Bursts

Dynamic Internet Congestion with Bursts

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.

Grafik Top
Authors
  • Schmid, Stefan
  • Wattenhofer, Roger
Grafik Top
Supplemental Material
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
13th Annual IEEE International Conference on High Performance Computing (HiPC)
Divisions
Communication Technologies
Subjects
Informatik Allgemeines
Event Location
Bangalore, India
Event Type
Conference
Event Dates
December 2006
Date
2006
Export
Grafik Top