Loss rates bounds for IP switches in MPLS networks

We propose in this paper to evaluate the performance of an IP switch in MPLS networks. We focus our study on an important QoS parameters for users which is the packet loss rates. We use a mathematical method based on stochastic comparisons of Markov chains in order to compute loss rate bounds. The system understudy can be represented by a multi-dimensional Markov chain which is too large to be solved by numerical methods. The key idea of the proposed methodology is to define bounded models with a reduced state space, so easier to solve. These bounded models provide upper and lower bounds on packets loss rates. We give in this paper the proof that the bounded models provide really stochastic bounds on performance measures. Numerical results confirm the proof and show the quality of these bounds.

[1]  Lionel M. Ni,et al.  Traffic engineering with MPLS in the Internet , 2000, IEEE Netw..

[2]  T. Lindvall Lectures on the Coupling Method , 1992 .

[3]  Son T. Vuong,et al.  Dynamic-distributed differentiated service for multimedia applications , 2000, Proceeding International Conference on Dependable Systems and Networks. DSN 2000.

[4]  J. Lawrence Designing multiprotocol label switching networks , 2001 .

[5]  William A. Massey,et al.  New stochastic orderings for Markov processes on partially ordered spaces , 1984, The 23rd IEEE Conference on Decision and Control.

[6]  Michel Doisy,et al.  Comparaison de processus markoviens , 1992 .

[7]  Farouk Kamoun,et al.  Small packets aggregation in an IP domain , 2001, Proceedings. Sixth IEEE Symposium on Computers and Communications.