An Analysis of Constraint-based Routing in MPLS

Project Description:

1. Introduction

Multi-protocol Label Switching (MPLS) has now become a fundamentally important technology in the internet. Several of the largest Internet service providers have deployed MPLS in their production networks to solve problems such as traffic engineering and to offer IP services efficiently over ATM backbone networks. [5]

MPLS can deliver control and performance to IP data packets through the use of label switched paths (LSPs). One protocol used to implement the LSPs is Constraint-based routing using Label Distribution Protocol (CR-LDP).

Constraint-based Routing (CBR) computes routes that are subject to constraints such as bandwidth and administrative policy. Because Constraint-based Routing considers more than network topology in computing routes, it may find a longer but lightly loaded path better than the heavily loaded shortest path. Network traffic is hence distributed more evenly. [5]

2. Project plan

In this project, we will perform simulations using Constraint-based Routing capability of the MPLS model MNS2 in NS-2. We will compare the overall packet delay from two scenarios: In scenario 1 LSPs are set up in the increasing importance order. While in scenario 2, LSPs are set up in the decreasing importance order. The goal of our project is to verify that the set up order of LSPs has great impact on the overall packet delay of all network traffics.

Reference: