Performance Analysis of Utility Based Congestion Control for Delay Tolerant Networks

Abstract

During the presence of buffers in the middle of network systems, every congestion task prompts buffer queuing and along these lines to a maximizing end-to-end delay. On the event of delay security applications, a huge delay won't be adequate and a solution to appropriately handle congestion tasks while keeping up a low end-to-end delay is required. Delay based congestion techniques are a reasonable solution as they focus to restrict the accomplished end-to end delay. They don't perform well when sharing the data bandwidth with congestion control methodologies not controlled by delay limitations. Our objective is to fill this hole, proposing a novel congestion control technique for delay constrained network over best exertion packet distributed systems. The proposed technique can keep up a limited queuing delay while contending with other delay based streams, and keep away from starvation while contending with loss based streams. The work receive the price based distributed component as congestion control, yet the work present a novel non linear mapping between the accomplished delay and the price capacity, and the work join both delay and loss data into a own price term

based on packet interarrival methodologies. The work investigation for our novel technique and the project demonstrate its performance in the reproduction results about completed in the NS3 system.  Practice results about exhibit that the proposed technique is ready to: accomplish great intra-convention decency properties, control productively the efficiently to-end delay, lastly, and protect the spill out of starvation when different streams cause the queuing delay to develop unreasonably.