Call Admission Control in IP networks with QoS support

This paper addresses the problem of admission control for IP networks with QoS support. Several admission control architectures and algorithms are presented and compared. Special attention is given to the probing algorithm. The stealing problem associated with this mechanism is studied through simulation.

[1]  Fred Baker,et al.  Network Working Group Aggregation of Rsvp for Ipv4 and Ipv6 Reservations , 2002 .

[2]  Gunnar Karlsson,et al.  Admission control based on end-to-end measurements , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Edward W. Knightly,et al.  Inter-class resource sharing using statistical service envelopes , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[4]  Scott Shenker,et al.  Endpoint admission control: architectural issues and performance , 2000, SIGCOMM.

[5]  D. Estrin,et al.  RSVP: a new resource reservation protocol , 2001 .

[6]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[7]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

[8]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[9]  Zhi-Li Zhang,et al.  Decoupling QoS control from core routers: a novel bandwidth broker architecture for scalable support of guaranteed services , 2000, SIGCOMM.

[10]  Ion Stoica,et al.  Providing guaranteed services without per flow management , 1999, SIGCOMM '99.

[11]  Edward W. Knightly,et al.  Scalable Services via Egress Admission Control , 2001, IEEE Trans. Multim..

[12]  B. Achiriloaie,et al.  VI REFERENCES , 1961 .