Alternate route selection algorithm for short-lived traffic in MPLS network

Abstract

This thesis presents alternate routing algorithm for short-lived traffic in MPLS network. Dynamic routing algorithm, exclusively for long-lived traffic, can be used efficiently to avoid lots of frequencies to update routing table, control traffic overhead and computational overhead which mainly come from traffic fluctuation on network. However, the congestion problem, due to short-lived traffic, has difficulties to handle. So, the simple and robust algorithm is needed for short-lived traffic to reduce the traffic loss probability. The proposed model supports the differentiated routing schemes for short-lived traffic and long-lived traffic. We proposed alternate routing algorithm and this algorithm is applied when short-lived traffic faces the congestion link. We restricted the additional hops which are consumed by our algorithm to minimize the resource waste and show the effect of additional hops. The proposed approaches reduce the packet loss probability about 0.6% to 1.7% under various link utilizations and different network topologies. Finally, we compare our proposed algorithms with and without crank-back.