02-05-2012, 04:44 PM
A UNIFIED APPROACH TO CONGESTION CONTROL AND NODE-BASED MULTIPATH ROUTING
[attachment=21091]
Abstract
The paper considers a TCP/IP-style network with flow control at end-systems 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 ns2-simulations 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.
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.
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.
[attachment=21091]
Abstract
The paper considers a TCP/IP-style network with flow control at end-systems 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 ns2-simulations 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.
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.
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.