MPLS performance evaluation in backbone network

This paper introduces a new method to describe the lookup process of IP and multiprotocol label switching (MPLS) in backbone network. Using this method, we can get probability density functions respectively for IP lookup time in routing table and MPLS lookup time in forwarding table. A M/G/1/K queuing system is used to analyze the average packet delay. Relative MPLS performance compared to IP is evaluated. The evaluation results turns out to be that for well-designed MPLS equipments, original IP packet delay can be reduced by 30% or more and label merging technology has only great significance when network traffic load is very heavy.

[1]  Günter Karjoth,et al.  Routing on longest-matching prefixes , 1996, TNET.

[2]  G. Swallow.  MPLS advantages for traffic engineering , 1999, IEEE Commun. Mag..

[3]  Christopher Edwards,et al.  The Internet: a global telecommunications solution? , 2000, IEEE Netw..

[4]  Kenneth P. Laberteaux,et al.  Traffic engineering algorithms using MPLS for service differentiation , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[5]  Grenville Armitage.  MPLS: the magic behind the myths [multiprotocol label switching] , 2000 .

[6]  Grenville Armitage,et al.  MPLS: the magic behind the myths , 2000 .