Dynamic label switched path optimization algorithm in MPLS network for mobile IP services

Abstract

This thesis presents a dynamic LSP-optimization decision algorithm in MPLS network for the mobility support. In the case of mobile environment, the MPLS network architecture needs some additional functionality. So this thesis proposes a mobility supporting architecture, node structure, and protocol procedures to support mobility. Also the additional functionality mainly reuses the functions of pre-existing mobile-IP and MPLS protocols. To support the mobility, there should be a decision to make a selection between two metholds; path-extension and path-optimization. Because these methods have different characteristics, this thesis examines the behavior and effect of each method and proposes a path-optimization decision algorithm that determines when the path-optimization should be performed or just path-extension is enough. A cost function is defined to make a numerical analysis and compare the performance of proposed algorithm with others. And mobility factor is modeled as a renewal process to cover the various kind of mobile terminals movement within the network. As we can see in the numerical results, proposed algorithm not only performs well in terms of performance with signaling interruption and end-to-end delay but also provides a control parameter to adjust the system for a desired QoS level. Also the performance of proposed architecture and algorithm is nearly reaching the performance of WATM. In the numerical results, the cost function reaches about 90% of the WATM’s one although it doesn’t permit the cross-over switch. By presenting the way to predict the performance of the end-to-end delay and handoff interruption, this thesis makes a basis of design the mobile internet for the IMT-2000 or other kind of next generation mobile services. Also the results can be used for an index of performance for the other algorithms.