Comparative Analysis of MPLS TP and IP MPLS Technologies for Communication Networks

Implementation plan:
—————————-
[+] Scenario 1: Small Scale Network using MPLS/TP:

Step 1: Initially we construct a Network consisting of 20 – Routers.

Step 2: Then, we implement Dijkstra’s algorithm to find the shortest path for the routers .

Step 3: Then, we implement the mathematical model for traffic latency.

Step 4: Finally, we plot the metrics for the following:

5.1: Throughput

5.2: latency

5.3: Packet Loss

5.4: Traffic Load

5.5: Jitter

[+] Scenario 2: Medium Scale Network using MPLS/TP:

Step 1: Initially we construct a Network consisting of 100 – Routers.

Step 2: Then, we implement Dijkstra’s algorithm to find the shortest path for the routers.

Step 3: Then, we implement the mathematical model for traffic latency.

Step 4: Finally, we plot the metrics for the following:

5.1: Throughput

5.2: latency

5.3: Packet Loss

5.4: Traffic Load

5.5: Jitter

[+] Scenario 3: Large Scale Network using MPLS/TP:

Step 1: Initially we construct a Network consisting of 250 – Routers.

Step 2: Then, we implement Dijkstra’s algorithm to find the shortest path for the routers.

Step 3: Then, we implement the mathematical model for traffic latency.

Step 4: Finally, we plot the metrics for the following:

5.1: Throughput

5.2: latency

5.3: Packet Loss

5.4: Traffic Load

5.5: Jitter

[+] Scenario 4: Small Scale Network using IP-MPLS:

Step 1: Initially we construct a Network consisting of 20 – Routers.

Step 2: Then, we implement Dijkstra’s algorithm to find the shortest path for the routers.

Step 3: Then, we implement the mathematical model for traffic latency.

Step 4: Finally, we plot the metrics for the following:

5.1: Throughput

5.2: latency

5.3: Packet Loss

5.4: Traffic Load

5.5: Jitter

[+] Scenario 5: Medium Scale Network using IP-MPLS :

Step 1: Initially we construct a Network consisting of 100 – Routers.

Step 2: Then, we implement Dijkstra’s algorithm to find the shortest path for the routers.

Step 3: Then, we implement the mathematical model for traffic latency.

Step 4: Finally, we plot the metrics for the following:

5.1: Throughput

5.2: latency

5.3: Packet Loss

5.4: Traffic Load

5.5: Jitter

[+] Scenario 4: Large Scale Network using IP-MPLS :

Step 1: Initially we construct a Network consisting of 250 – Routers.

Step 2: Then, we implement Dijkstra’s algorithm to find the shortest path for the routers.

Step 3: Then, we implement the mathematical model for traffic latency.

Step 4: Finally, we plot the metrics for the following:

5.1: Throughput

5.2: latency

5.3: Packet Loss

5.4: Traffic Load

5.5: Jitter

Software Requirement:
—————————–

1. Development Tool: Ns3.26 with Python or above

2. Development OS: Ubuntu 16.04 LTS or above

Note:
———

1) If the above plan does not satisfy your requirement, please provide the processing details, like the above step-by-step.

2) Please note that this implementation plan does not include any further steps after it is put into implementation.

3) If the above plan satisfies your requirement please confirm and inform us.

4) We develop simulation based projects only, not in real time.