A scalable CAC technique to provide QoS guarantees in a cascade of IP routers

In this paper, we propose a solution to provide deterministic quality of service (QoS) guarantees in Differentiated Services (DiffServ) framework. We define packet classification functions and traffic conditioning functions, with particular emphasis on shaping functions at edge routers. Our proposal is based on aggregated classification states, within core routers. The original aspect of our contribution is the introduction of a connection admission control (CAC) procedure on the selected paths, in order to provide performance guarantees to traffic aggregates. Another key aspect is the low involvement of core routers in traffic management, obtained by pushing complexity and processing load towards the boundary of the DiffServ domain. We analyze which guarantees can be provided to flow aggregates in these conditions. To this end, we make use of network calculus for deriving bounds on delay and losses within each network node.

[1]  Geert Jan Olsder,et al.  Synchronization and Linearity: An Algebra for Discrete Event Systems , 1994 .

[2]  Debasis Mitra,et al.  Traffic shaping at a network node: theory, optimum design, admission control , 1997, Proceedings of INFOCOM '97.

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

[4]  Debasis Mitra,et al.  A New Approach for Allocating Buffers and Bandwidth to Heterogeneous Regulated Traffic in an ATM Node , 1995, IEEE J. Sel. Areas Commun..

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

[6]  Mario Gerla,et al.  Internet QoS Routing Using the Bellman-Ford Algorithm , 1998, HPN.

[7]  Norio Shiratori,et al.  QoS based routing algorithm in integrated services packet networks , 1997, Proceedings 1997 International Conference on Network Protocols.

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

[9]  Jean-Yves Le Boudec,et al.  Application of Network Calculus to Guaranteed Service Networks , 1998, IEEE Trans. Inf. Theory.

[10]  Cheng-Shang Chang.  On Deterministic Traffic Regulation and Service Guarantees : A Systematic Approach by Filtering , 1998, IEEE Trans. Inf. Theory.

[11]  Ness B. Shroff,et al.  Admission control for statistical QoS: theory and practice , 1999, IEEE Netw..

[12]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.