Please use this identifier to cite or link to this item:
|Title:||SIMULATION STUDY OF TRAFFIC ENGINEERING ALGORITHMS FOR MPLS NETWORKS|
|Keywords:||ELECTRONICS AND COMPUTER ENGINEERING;TRAFFIC ENGINEERING ALGORITHMS;MPLS NETWORKS;MULTI PROTOCOL LABEL SWITCHING|
|Abstract:||Multi protocol label switching (MPLS) is aimed at optimizing network resource utilization, while also providing traffic-engineering capabilities to the network administrator. It is viewed as an important part of the core of the proposed next generation networks. Central to this concept, are the label switched paths (LSPs), which are used for transmission of labeled IP packets through the MPLS domains, much the same way ATM cells are transported across VCs, In this thesis, we have implemented the Multipoint-to-point (m-t-p) LSPs technique, proposed by IETF as a traffic engineering measure to reduce number of LSPs and link labels. It is shown that the total number of LSPs required is 0 (N), where N is the number of edge nodes. We have modified the algorithm given in  to further reduce the number of LSPs and link labels. This is achieved by neglecting subset LSPs of network model. This gives a great improvement in reducing the number of LSPs and link labels. We have also implemented a flow assignment scheme to balance the link load across the network, and to handle the failure recovery. Two network models in server-oriented architecture have been simulated to compare these two approaches with conventional approaches. The m-t-p LSPs approach was compared with p-t-p approach and flow assignment scheme was compared with Shortest Path first (SPF) approach. The Simulation model is written in C++ in Linux environment on a Pentium-III PC.|
|Research Supervisor/ Guide:||Garg, Kumkum|
|Appears in Collections:||MASTERS' DISSERTATIONS (E & C)|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.