arrow
Return

Burst-level congestion control using hindsight optimization

delete2002-06-01
delete28
PRE
AI
G
Gang Wu
E
Edwin K. P. Chong
R
Robert Givan
DOI:10.1109/TAC.2002.1008362delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We consider the burst-level congestion-control problem in a communication network with multiple traffic sources, each modeled as a fully controllable stream of fluid traffic. The controlled traffic shares a common bottleneck node with high-priority cross traffic described by a Markov-modulated fluid (MMF). Each controlled source is assumed to have a unique round-trip delay. The goal is to maximize a linear combination of the throughputs delay, traffic-loss rate, and a fairness metric at the bottleneck node. We introduce a simulation-based congestion-control scheme capable of performing effectively under rapidly varying cross traffic by making use of the provided MMF model of that variation. The control problem is posed as a finite-horizon Markov decision process, and is solved heuristically using a technique called Hindsight Optimization. We provide a detailed derivation of our congestion-control algorithm based on this technique. Our empirical study shows that the control scheme performs significantly better than the conventional proportional-derivative (PD) congestion-control method.
Keywords:
communication networks
congestion control
Markov decision processes
Markov-modulated fluid
online simulation
traffic models
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Automatic Control cover
IEEE Transactions on Automatic Control
IF:
7
Papers:
1.3W
Citations:
6.7W

Organization

No organization information available