Dynamic internet congestion with bursts

Authors:
Stefan Schmid;Roger Wattenhofer
Affiliations:
Computer Engineering and Networks Laboratory (TIK), ETH Zurich, Zurich, Switzerland;Computer Engineering and Networks Laboratory (TIK), ETH Zurich, Zurich, Switzerland
Venue:
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Year:
2006

Citing 15
Cited 0

Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels

IEEE Transactions on Information Theory
On the self-similar nature of Ethernet traffic (extended version)

IEEE/ACM Transactions on Networking (TON)
TCP/IP illustrated (vol. 2): the implementation

TCP/IP illustrated (vol. 2): the implementation
Adversarial queueing theory

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The performance of TCP/IP for networks with high bandwidth-delay products and random loss

IEEE/ACM Transactions on Networking (TON)
Adaptive packet routing for bursty adversarial traffic

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Online computation and competitive analysis

Online computation and competitive analysis
Universal-stability results and performance bounds for greedy contention-resolution protocols

Journal of the ACM (JACM)
Dynamic TCP acknowledgement and other stories about e/(e-1)

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A randomized online algorithm for bandwidth utilization

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Sharing the cost of multicast transmissions

Journal of Computer and System Sciences - Special issue on Internet algorithms
A note on models for non-probabilistic analysis of packet switching networks

Information Processing Letters
Optimization problems in congestion control

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Improving the reliability of internet paths with one-hop source routing

OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Universal packet routing algorithms

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.