Analysis and Simulation Routing Management MIRA (Minimum Interference Routing Algorithm) for Speedy traffic on MPLS Network

By : 1. Rendy Munadi (rnd@ittelkom.ac.id) 2. Akhmad Zaimi (djimie@gmail.com) 3. Sofiah Naning (snh@ittelkom.ac.id)

104/08/2023

BackgroundRouting Management

◦ Multi-services multi-treatment single network (best effort & QOS aware)

◦ MPLS Network as IP backbone has capacity constraint and routing mechanism constraint (SPF).

◦ The new routing management scheme is proposed using Minimum Interference Routing Algorithm (MIRA).

Research’s objective◦increased availability and accessibility

Speedy (BE service) to optimize network resource usage

04/08/2023 2

Basic Concept of MPLS-TE

In MPLS-TE, headend LSR should be accomplished with network topology and other auxiliary information.

The required information: bandwidth, TE metric, max. bandwidth, max. bandwidth reserveable, unreserved max. bandwidth and administrative group of links. 04/08/2023 3

MPLS-TE: FIB Construction

Basic Concept of MIRA

Least cost routing, from 1 9: 1 – 4 – 5 – 9 (cost=4)◦ 2 8: 2 – 4 – 5 – 8 (cost=4, but interfere 1-9 path)

◦ 3 8: 3 – 4 – 6 – 7 – 5 – 8 (cost=8)

Terms: interference, minimum interference path, critical link

Next issues:◦ Observes critical links of QoS traffic with multi-path

consideration◦ Analyze best method to optimize netw. resources for both,

BE+QoS service, in term of multi-path.

04/08/2023 4

Algorithm (Enhancement of MIRA)

04/08/2023 Akhmad Zaimi 212080001 6

Input◦ A graph G(N,L) and a set B of residual capacities on

all the arcs.◦ An ingress node a and an egress node b between

which a flow of D demand units have to routed Output

◦ A route between a and b having capacity of D units of bandwidth

Algorithm◦ Identify Ingress Egress Node including bw. allocation◦ Compute weight of Ingress Egress Pair:

◦ Compute the candidate paths for all ◦ Compute the set of critical links Csd for all

M1: all links, both MP and BP, are critical link M2: if B(l) < D then l = Csd, resource allocated for both MP and

BP M3: if B(l) < D then l = Csd, resource allocated only for MP

Algorithm (Enhancement of MIRA)

04/08/2023 Akhmad Zaimi 212080001 7

◦ Compute the weight of critical link

◦ Compute network cost (M1, M2, M3)

◦ Include link capacity as a factor of network cost (adopt OSPF cost)

◦ Eliminate all links with B < D and form a reduced network◦ Use Djikstra’s algorithm to compute the shortest path (a-b)

in the reduced network based on network cost◦ Route the demand of D units from a to b and update the

residual capacities

Candidate Paths Analysis

04/08/2023 Akhmad Zaimi 212080001 8

The applied rules:

Candidate path of S1 to D7:◦ Path 1: 1 – 2 – 5 – 7 (main path)◦ Path 2: 1 – 2 – 8 – 10 - 7 (backup path)◦ Path 3: 1 – 3 – 4 – 6 – 9 – 7 (backup path)

Analyze critical links on all of candidate path

1 7

2 5

3 4

8

6 9

10

Network Topology

9

Routing MechanismNodes route traffic relying on least cost routing

mechanism.On previous topology, source to destination

routing would be as the following table.

04/08/2023 10

Traffic Source Sink Hop Cost1 2 3 4 5

Upstream

1 13 1 23 10 9 13 0.2202 13 2 19 10 9 13 0.2203 13 3 5 7 9 13 0.2004 13 4 7 9 13 - 0.1505 13 5 7 9 13 - 0.1006 13 6 8 7 9 13 0.191

Downstrea

m

13 1 13 9 10 23 1 0.22013 2 13 9 10 19 2 0.22013 3 13 9 7 5 3 0.20013 4 13 9 7 4 - 0.15013 5 13 9 7 5 - 0.10013 6 13 9 7 8 6 0.191

Analysis and DiscussionModeling Routing Management System

◦ Input of MIRA: G(N, L, B); B = residual capacity (Mbps) on each links

04/08/2023 11

1 2 3 4 5 6 7 … 39

1 0 0 0 0 0 0 0 … 0

2 0 0 0 0 0 0 0 … 0

3 0 0 0 0 905 0 0 … 04 0 0 0 0 0 0 725 … 0

5 0 0 368 0 0 0 1688 … 06 0 0 0 0 0 0 0 … 07 0 0 0 224 1197 0 0 … 1740. . . . . . . . … .39 0 0 0 0 0 0 716 … 0

Modeling Routing Management System◦ Ingress Egress Pairs VPN IP

04/08/2023 12

Code Host Profile Destination nodeDest

Subs Demand 2 13 18 21 27 29 34 35

1 PE-BRAS-BOO 158 183.248 x x x   x x x x 72 PE-BRAS-TAN 249 252.776   x x x x x x x 73 PE-BRAS-BKS 158 172.88 x x x x x x     64 PE-BRAS-KBB 15 165.956 x x x x x x     65 PE-BRAS-JT 157 191.132 x x x x x x     66 PE-BRAS-GB 38 349.412 x x x x     x x 6

17 PE-GB 179 224.156 x x x x     x x 630 PE-ANC 10 105.632 x x   x x   x x 636 PE-SBB 27 114.32 x x x x x x x   7

Modeling Routing Management System◦ Size of Demands for Each Ingress Egress Pairs

(Mbps)

◦ Weight of Ingress Egress Pairs

04/08/2023 13

Aspects Method I Method II Method III

Initial capacity (in Mbps) 105,624.86 105,624.86 105,624.86

Analysis (in Mbps): • Resource consumed by VPN IP• Percentage• Residual network

28,264.9826.76%

77,359.88

28,264.9826.76%

77,359.88

15,735.1314.90%

89,889.73

Number of Critical Link 1286 154 41

Unique Critical Link 68 14 6

Modeling Routing Management System◦ The number of candidate paths (main path and

backup) is about 251 candidate paths of IP VPN.

◦ Then, analyze critical links within all of candidate paths. And here is the result of computation using 3 methods.

04/08/2023 14

Highlight of M3 ResultCritical link regards to M3 computation

04/08/2023 15

1 2 3 4 5 6 7 … 39

1 0 0 0 0 0 0 0 … 0

2 0 0 0 0 0 0 0 … 0

3 0 0 0 0 0.1 0 0 … 04 0 0 0 0 0 0 0.1 … 0

5 0 0 0.1 0 0 0 0.1 … 06 0 0 0 0 0 0 0 … 07 0 0 0 0.1 0.1 0 0 … 0.04… … … … … … … … … …39 0 0 0 0 0 0 0.1 … 0

HopWeight Link Main Path Backup PathNode Node

6 8 0.1257 2 07 4 0.0124 2 38 6 3.8515 8 69 7 0.0439 0 2

10 19 7.2534 6 619 2 7.1050 2 4

Network cost regard to M3 computation

Analysis and DiscussionOutput Analysis

◦Result path of routing management

◦Then, to prove the interference path produced by SPF algorithm.

04/08/2023 16

Output Analysis

04/08/2023 Akhmad Zaimi 212080001 17

Interference Analysis of SPF algorithm:◦ From 13 2 passes through some critical links (hop 3

and 4)◦ From 13 3 passes through one critical links, which is

hop 2.Source node 13  Destination node 2 

Path OSPF:

  Hop 1 Hop 2 Hop 3 Hop 4  

13  9  10 19 2

 

Source node 13  Destination node 3 

Path OSPF:

  Hop 1 Hop 2 Hop 3 Hop 4  

13  9 7 5  3 

 

Analysis and DiscussionOutput Analysis

◦Network resource optimization.

04/08/2023 18

Aspect SPF MIRANet. residual cap.:- Pre traffic Speedy flow- Post traffic Speedy flow

90,628.0489,861.94

90,628.0489,628.59

Net. res. usage 766.10 999.46

Demand Size 890.89 999.46

Demand Loss 124.79 0.00

Analysis and DiscussionNetwork Performance

04/08/2023 19

Analysis and DiscussionNetwork Performance

04/08/2023 20

Analysis and DiscussionNetwork Performance

04/08/2023 21

Conclusion

Implement and enhance MIRA as routing management platform reduces the occurrence of traffic interference and thus network congestion should be minimized.

The network optimization (through critical link analysis) would be achieved by managing routing of traffic in the network.

Routing management with MIRA is proficient to leverage network performance, even throughput, received packet and delay04/08/2023 22

Thank You

2304/08/2023