Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
MATE: multipath adaptive traffic engineering
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
| Hi-index | 0.00 |
We consider data networks in which real-time/near real-time applications require not only successful transmission of packets from source to destination, but also specific end-to-end delay bounds, such as voice over IP. Although there is a well-developed general theory for control of best-effort packet traffic in data networks (elastic traffic), little is known about decentralized control mechanisms that ensure end-to-end performance bounds (inelastic traffic). In this paper we propose and analyze a simple, distributed and self-stabilizing rate control scheme that uses only end-to-end delay feedback to ensure QoS while using the network resources efficiently. In particular, we show that while for short paths (up to two hops long) the proposed scheme guarantees end-to-end delay budgets for all node pairs and also maximizes the total network throughput, when there are long paths in the network the resulting solution, even though still self-stabilizing and QoS-compliant, can deviate from the global network throughput. We present numerical results and conclude with a discussion of possible implementations of the proposed scheme in multi-service networks involving a mixture of best-effort and QoS-constrained services.