Abstract

The paper considers a TCP/IP-style network with flow control at endsystems based on congestion feedback and routing decisions at network nodes on a per-destination basis. The main generalization with respect to standard IP is to allow routers to split their traffic in a controlled way between the outgoing links. We formulate global optimization criteria, combining those used in the congestion control and traffic engineering, and propose decentralized controllers at sources and routers to reach these optimal points, based on congestion price feedback. We first consider adapting the traffic splits at routers to follow the negative price gradient; we prove this is globally stabilizing when combined with primal congestion control, but can exhibit oscillations in the case of dual congestion control. We then propose an alternative anticipatory control of routing, proving its stability for the case of dual congestion control. We present a concrete implementation of such algorithms, based on queuing delay congestion price. We use TCP-FAST for congestion control and develop a multi path variant of the distance vector routing protocol RIP. We demonstrate through ns2simulations the collective behavior of the system, in particular that it reaches the desired equilibrium points.

Existing system

In Existing System, Sender find the congestion free Single shortest path. Sender sends the packet through the single shortest path. Existing systems based on congestion feedback and routing decisions at network nodes on a per-destination basis. Large scale network and large size of data transmission is not suitable based on this approach. Congestion Occurred on selected shortest single path during data transmission.

Disadvantages

Not Suitable for Long data Transmission. Time consuming problem. No packet id usage in packet header

Proposed system

In proposed system, Using TCP FAST and RIP Mechanism In this mechanism is used to avoiding Congestion problem on data transmission. RIP (Routing Information Protocol) is used to measure the distance vector on Destination based available routes. Sort the all available routes based on the delay time. If more than one shortest path available means use those multiple paths, packets are split equally depending upon the shortest path count.

Advantages

Multi path Routing. Reduce the data transfer time. Packet id avoid reorder problem at receiver side

System Requirement

Software Requirements: Java1.3 or More Java Swing front end SQL-back end Windows 98 or more. Hardware Requirements: Hard disk RAM Processor : : : 40 GB 128mb Pentium

Modules:
Network Construction Congestion Measurement Multi Path Transmission Receiver

Network Construction:
We construct a network with individual

systems. Node enters IP address, port number, Node name in to server system at the time of user login. Node enters the details of links in to server system. Server maintains those details also With this network we enable our transmission of messages. Collecting Systems ip address, port. it maintain in the centralized Server system.

Congestion Measurement:
Send control packets to all available paths Note the starting time and ending time of

acknowledge of request. Calculate the delay time of each available path and then sort those delay times. Minimum delay path has minimum traffic rate so packets are send through this path in fast manner. So Congestion reduces in data transmission and delay also reduces by use this shortest path.

Multi Path Transmission:

Among those path details calculate the more

than one shortest path if it is available means send packets to that path. First of all divide packets depending upon the shortest path count. Packets are divided equally with packet id. It avoids the congestion and also time consuming problem on the data transmission . All paths are transmitting the packets in equal time because those are same rank in shortest path calculation.

Receiver:
If More than one Shortest paths available

means, packets tranferthrough these paths from source to destination. Receiver receive all packets and then display the receive content. Receiver order all packets based on packets id If we want store the received message means using the save message box we choose the destination. Save message box open the file dialog box and select the destination position in the system File content stores on particular position by create the file and write the content to that file.