Performance comparison of routing algorithms used in packet switching computer networks

This thesis investigates and compares some of the routing algorithms based on multi-protocol label switching (MPLS) architecture to provide better Traffic Engineering (TE) for the networks. The main issue here is focusing on the dependency on the rapidly growing internet service on Traffic Engineering. The MPLS is a modern technique which provides the real time communications of the multimedia data on the network service in such a way that it enhances and increases the speed of the routers. Furthermore, the MPLS architecture allows defining explicit routers in the network and ensures the Traffic Engineering Management. MPLS is developed and researched as one of the most important protocols among the protocols of today which have been built depending on the algorithms designed to get shortest path in the network for packet transmission. Another essential point are the internet service providers (ISP) which are needed to improve routing algorithm used on MPLS routers . Thus, the algorithm should be clarified and developed to suit the router devices. The advanced routing algorithms also use the advantage of MPLS network. There are many advanced routing algorithms that have been researched and used with MPLS protocol. The most important types support finding solutions according to the demand of label switching path (LSP) by use of traffic based routing, to decrease the blocking probability in the future. Therefore, in this thesis a well- known MPLS protocol network is studied using Matlab implementation. Then, it is applied with some routing algorithms. Finally, the simulation results are investigated and analyzed from different point of views. At the end of the work, some investigated routing algorithms are suggested for different kind of network conditions. These simulation results also demonstrate the advantages of integrated routing algorithms used in packet switching computer networks.