Project Title: Multipath Routing Algorithm for Congestion

Minimization
1. Introduction:
1.1 Purpose:
Traditional routing schemes that route all traffic along a single path, multipath
routing strategies allow packets with the same source and destination to take more than
one possible path. This facility can be used to ease congestion and overcome node failure.
Multipath routing can be fundamentally more efficient than the currently used single-path
routing protocols. It can significantly reduce congestion in “hot spots,” by deviating
traffic to unused network resources, thus, improving network utilization and providing
load balancing. Moreover, congested links usually result in poor performance and high
variance. For such circumstances, multipath routing can offer steady and smooth data
streams. While transferring the packets through multiple paths, RMP (Restricted
Multipath) Problem arises. In this project, we introduce the PFC algorithm to overcome
the RMP problem for data transfer.

1.2. System Overview:

• System Objectives:
The system aims to solve the problem of packet congestion by choosing all the
good paths instead of choosing the one best path to transfer packets.

• System Benefits:

- Using unused Links

- No packet loss while transferring packets.
- Reduce congestion in hot spots by deviating the traffic to unused
network resources.
- Improved Network Utilization
- Provide Load Balancing
- Steady and smooth Data Streams.
 • Technology Used:
Hardware Requirements:
Processor : Intel Pentium IV

RAM : 512 MB

Monitor/Panel : Plug and Play Monitor

Hard Disk : 40 GB

Keyboard : 109 Keys

Mouse : PS/2 Compatible Mouse Port

Software Requirements:
Operating System : Windows XP

Front End : JAVA

Back End : MS-SQL Server 2005

Package (IDE) : Net Beans 5.5

2.0 System modules:

This system consists of the following modules:
1. Login Module
2. Node and Path creation
3. Optimal Paths finding
4. File Transfer
5. Alternate path creation
6. Implementation of PFC Algorithm
2.1. Modules Description:
Login module:
The user (Admin) can login by entering the authentication details.

Node and Path creation:

In this module, we are going to find out which machines are connected to
the network. By finding the active machines we can send the data’s from source
to destination in a multiple paths. Before that, we have to create the paths between
machines. For every link has a particular length value.

Optimal Paths Finding:

In order to send the packets from source to destination we have to find out
the paths. In stead of routing all traffic along a single path, we have to distribute
the traffic among several good paths in order to ease congestion. For choosing the
multiple paths, multipath routing algorithm optimally split the traffic between a
given set of paths have been investigated in the context of the flow control. In
optimal paths finding, the multipath routing adopting a rigorous approach and
formulate it as an optimization problem of network minimization.

File Transfer
In this module, files can be transferred from source to destination through
multiple paths. For transferring the files in a multiple paths, first files can be
splitted into packets. After splitting the packets, particular number of packets will
send through each selected paths. By this way, all the packets will send to the
destination through multiple paths.
 Alternate Path Creation
In this module, if any machines left from the network or any link have
been damaged there is a problem to send the packet from source to destination. At
that time, we have to find the alternate paths for sending the packets from source
to destination. The alternate paths will be created by with minimal cost.

Implementation of PFC Algorithm

While transferring the packets, every link has particular cost value. If the cost
value exceeds restricted length value Restricted Multipath problem (RPM) will arise. To
overcome the Restricted Multipath problem we have to introduce the PFC algorithm. The
algorithm subtracts the flow that traverses through that from the demand in the path. The
algorithm repeats this process until all the non simple paths into the simple paths to
transfer the packets from source to destination.