Implementation and

Analysis of Intra-Domain
Routing Protocol
Group Members:
Fatima Sadiq (1029)
Rubab Zahra (1030)
Marrium Qureshi(1022)
Project Supervisor: Engr.Ihsan-Ul-Haq

1-32

Agenda
Routing
Abstract
Problem Statement
Implementation
Verification
Validation
Significance of Our Work
Future Work
Demo

2-32

We have implemented k shortest path

Algorithm which has capability of avoiding
traffic congestion and reducing drop rate.

3-32

What is Routing
Routing is the core of IP networks. It
determined path in the IP network .It is
performed by router .In which the source
decide where and using which way to send
information.
4-32

Abstract
Routing algorithm calculate and update routing

table in advance for each pair of nodes.

We have implemented K-shortest path algorithm

in C++ and have validated and verified the

implemented code on both irregular and regular
network topologies.
The implemented code computes the set of

Kmax loopless paths between a pair of nodes.

5-32

Problem
Statement
Routing is the core of data networks. In the

existing Internet, shortest single path routing may

overwhelm some of the link which may result in
congestion while the remaining link may go
underutilized. The aim of this work is to
implement k-shortest path routing to fix the above
mentioned issue specially for QoS aware traffic.

6-32

Implementation

7-32

Verification
We have verified the code by reading again

and again our code.

8-32

Validation
Testing with the networks provided on the website

university of San Francisco Computer Science

https://www.cs.usfca.edu/~

galles/visualization/Dijkstra.html

9-32

Validation

10-32

Validation

11-32

Validation

12-32

Validation

13-32

Validation
Further

testing on well-known topologies

Irregular Networks
1. NSF Network
2. EON
3. Cost239 Network
4. UBN Network
.Regular Networks
1. Ring-10
2. CRing10-3
3. CRing10-4
14-32

National Science Foundation (NSF)

Network Topology

It is a 14-Node Network topology.

It has 21 links.

15-32

Output

16-32

European Optical Network (EON)

Topology

It is 19-Node Network Topology:

17-32

Output

18-32

Cost239
Network
It has 11-Node

19-32

Output

20-32

United States Backbone Network

It has 24-Nodes

21-32

Output

22-32

Ring-10
It has 10-Nodes.

23-32

Output

24-32

CRing10-3

25-32

Output

26-32

CRing10-4

27-32

Output

28-32

Significance of Work
As for as our knowledge is concerned, we have

not been able to find any running code for kshortest path routing on the Internet.
Loopless

Multiple Link Cost

K shortest Path may be used for:
Traffic

engineering
Better resource utilization may be achieved

29-32

Future Work
We presented a code to implement k shortest

path algorithm in C++ which can calculate more

than one path in a network by taking input and
giving output in text file which is easy and
efficient way of doing testing .
K-Shortest path routing can be used for traffic
engineering, load balancing and effective resource
utilization.
In

future this idea can be implemented in

OMNeT++ which is a network based simulator.
30-32

Demo

31-32

Thank You!!
Any
Questions..??

32-32