Adaptive back-pressure congestion control based on local information
- 1 January 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 40 (2), 236-250
- https://doi.org/10.1109/9.341781
Abstract
The problem of distributed congestion control as it arises in communication networks as well as in manufacturing systems is studied in this paper. In particular, a multistage queueing system that models virtual circuit and datagram communication networks and a class of manufacturing systems are considered. The topology may be arbitrary, there are multiple traffic classes, and the routing can be class dependent, with routes that may form direct or indirect loops. The model incorporates the functions of transmission scheduling, flow control, and routing, through which congestion control is performed in the network. A policy is given that performs these functions jointly. According to the policy, heavily loaded queues are given higher priority in service. A congested node may reduce the how from upstream nodes through a flow control mechanism. Whenever routing is required, it is performed in such a manner that the lightly loaded queues receive most of the traffic. For arrival processes with bounded burstiness, the policy guarantees bounded backlogs in the network, as long as the load of each server is less than one. The actions of each server are based on the state of its own queues and of the queues one hop away. Therefore, they are implementable in a distributed fashion. An adaptive version of the policy is also provided which makes it independent of the arrival rates.Keywords
This publication has 13 references indexed in Scilit:
- Calculating performance bounds in communication networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Throughput properties of a queueing network with distributed dynamic routing and flow controlAdvances in Applied Probability, 1996
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networksIEEE Transactions on Automatic Control, 1992
- Round-robin scheduling for max-min fairness in data networksIEEE Journal on Selected Areas in Communications, 1991
- A calculus for network delay. II. Network analysisIEEE Transactions on Information Theory, 1991
- Virtual clock: a new traffic control algorithm for packet switching networksACM SIGCOMM Computer Communication Review, 1990
- Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systemsIEEE Transactions on Automatic Control, 1990
- Stable, distributed, real-time scheduling of flexible manufacturing/assembly/diassembly systemsIEEE Transactions on Automatic Control, 1989
- Fast switching and fair control of congested flow in broadband networksIEEE Journal on Selected Areas in Communications, 1987