Distributed admission control
- 1 December 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 18 (12) , 2617-2628
- https://doi.org/10.1109/49.898741
Abstract
This paper describes a framework for admission control for a packet-based network where the decisions are taken by edge devices or end-systems, rather than resources within the network. The decisions are based on the results of probe packets that the end-systems send through the network, and require only that resources apply a mark to packets in a way that is load dependent. One application example is the Internet, where marking information is fed back via an ECN bit, and we show how this approach allows a rich QoS framework for flows or streams. Our approach allows networks to be explicitly analyzed, and consequently engineered.Keywords
This publication has 30 references indexed in Scilit:
- Sample path large deviations for queues with many inputsThe Annals of Applied Probability, 2001
- Models for a self–managed InternetPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2000
- Resource pricing and the evolution of congestion controlAutomatica, 1999
- Differential QoS and pricing in networks: Where flow control meets game theoryIEE Proceedings - Software, 1999
- Is service priority useful in networks?Published by Association for Computing Machinery (ACM) ,1998
- Random early detection gateways for congestion avoidanceIEEE/ACM Transactions on Networking, 1993
- On blocking in loss networksAdvances in Applied Probability, 1991
- Routing and Capacity Allocation in Networks with Trunk ReservationMathematics of Operations Research, 1990
- Congestion probabilities in a circuit-switched integrated services networkPerformance Evaluation, 1987
- Blocking probabilities in large circuit-switched networksAdvances in Applied Probability, 1986