Statistical bounds on the drop probability of assured forwarding services in DiffServ interior nodes under the processor sharing scheduling discipline

This paper addresses the problem of modelling and analysing an interior node in IETF's DiffServ services model. Specifically it is concerned with the performance of the DiffServ assured forwarding service category in presence of a premium service class. In this model, the network node shares its outgoing link capacity between a premium service representing the expedited forwarding (EF) per-hop behavior, and two classes of assured service, that represent two classes of the assured forwarding (AF) per-hop behavior. It this paper, the traffic is modelled as Markov modulated fluid sources, and we focus on a system where out of profile traffic is dropped at the edge of the network thus both AF queues support only one drop precedence. Using a decomposition approach, approximations, and spectral analysis, we are able to derive upper and lower bounds on the tail of the distribution of the buffer content for both AF classes given a generalized processor sharing scheduling is used to differentiate the two classes. Such approximate analysis of the interaction between traffic classes can help to achieve a better understanding of this type of networks; enables the provision of throughput differentiation as defined by the AF PHB through the GPS scheduler while quantifying delay; and finally helps simplify greatly the design of bandwidth brokers that do not rely on long term bandwidth (over) provisioning.

[1]  D. Mitra,et al.  Stochastic theory of a data-handling system with multiple sources , 1982, The Bell System Technical Journal.

[2]  D. Mitra.  Stochastic theory of a fluid model of producers and consumers coupled by a buffer , 1988, Advances in Applied Probability.

[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]  Anwar Elwalid,et al.  Fluid models for the analysis and design of statistical multiplexing with loss priorities on multiple classes of bursty traffic , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

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

[6]  Debasis Mitra,et al.  Analysis, approximations and admission control of a multi-service multiplexing system with priorities , 1995, Proceedings of INFOCOM'95.

[7]  Donald F. Towsley,et al.  Bounds, approximations and applications for a two-queue GPS system , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

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

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

[10]  Fred Baker,et al.  Assured Forwarding PHB Group , 1999, RFC.

[11]  Van Jacobson,et al.  A Two-bit Differentiated Services Architecture for the Internet , 1999, RFC.

[12]  Van Jacobson,et al.  An Expedited Forwarding PHB , 1999, RFC.

[13]  Christophe Diot,et al.  Simple performance models of differentiated services schemes for the Internet , 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).

[14]  Donald F. Towsley,et al.  A quantitative study of differentiated services for the Internet , 2000, Journal of Communications and Networks.

[15]  A. L. Narasimha Reddy,et al.  Modeling TCP behavior in a differentiated services network , 2001, TNET.

[16]  Marion Kee,et al.  Analysis , 2004, Machine Translation.