Citation key |
SW-DICWB-06 |
Author |
Schmid, Stefan and Wattenhofer, Roger |
Title of Book |
13th Annual IEEE International Conference on High Performance Computing (HiPC) |
Pages |
159–170 |
Year |
2006 |
ISBN |
978-3-540-68039-0 |
ISSN |
0302-9743 |
DOI |
http://dx.doi.org/10.1007/11945918_20 |
Location |
Bangalore, India |
Address |
Berlin / Heidelberg, Germany |
Volume |
4297 |
Month |
December |
Editor |
Robert, Yves and Parashar, Manish and Badrinath, Ramamurthy and Prasanna, Viktor K. |
Publisher |
Springer |
Series |
Lecture Notes in Computer Science (LNCS) |
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. |