Call Admission and Resource Reservation for Guaranteed QoS services in Internet

Many audio and video \play-back" applications require that all of their packets arrive within their play-back time. Furthermore, the applications with the hard real-time requirements also require guaranteed service from the network. These applications are covered under the \Guaranteed Quality of Service" speciications by the IETF. It guarantees that the packets will arrive within the guaranteed delivery time and the packets will not be discarded due to queue overrows, provided the ow traac stays within its speciied traac parameters. This paper gives an eecient and distributed algorithm based on the cost function to divide the end-to-end guaranteed QoS requirements into local QoS requirements which are then mapped into local resource requirements. The algorithm operates in three phases. In the rst phase, the nodes in the selected route give the information about their utilization level and the parameters associated with the scheduling algorithm used by them. The receiving node, based upon the information provided by the nodes in the route and its end-to-end delay requirements, takes the call admission decision. Once the decision to admit the call is taken, the nodes in the route do the resource allocation to meet the delay bound. The sender node now calculates the slack produced if any. The slack is then distributed to the nodes in the third phase. The results obtained are then shown to be applicable to the resource allocation for multicast connection establishment.

[1]  Dilip D. Kandlur,et al.  Provisioning of RSVP-based Services over a Large ATM Network , 1995 .

[2]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[3]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[4]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

[5]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[6]  Harrick M. Vin,et al.  Generalized guaranteed rate scheduling algorithms: a framework , 1997, TNET.

[7]  Anindo Banerjea,et al.  The Real-Time Channel Administration Protocol , 1991, NOSSDAV.

[8]  Harrick M. Vin,et al.  Determining end-to-end delay bounds in heterogeneous networks , 1995, Multimedia Systems.

[9]  Scott Shenker,et al.  Specification of Guaranteed Quality of Service , 1997, RFC.

[10]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[11]  Donald F. Towsley,et al.  Call admission and resource reservation for multicast sessions , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[12]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[13]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.