tcp

Mobile ad hoc network congestion control is a significant problem. Standard mechanism for congestion control (TCP), the ability to run certain features of a wireless network, several mutations are not common. In particular, the enormous changes in the network topology and the joint nature of the wireless network. It also creates significant challenges in mobile ad hoc networks (MANET), density is one of the most important limitations that disrupts the function of the entire network, after multi-path routing can load balance in relation to the single-path routing in ad hoc networks better, so the traffic division multiple routs congestion is reduced. This study is a multi-path load balancing and congestion control based on the speed of rate control mechanism to avoid congestion in the network provides communication flows. Given such a speed control method that is consistent is that the destination node copy speed is estimated at intermediate nodes and its reflection in the In the forward direction confirmation to the sender sends a packet, therefore the rate quickly estimate The results of the simulation has been set to demonstrate that a given method better package delivery speed and expanded capacity and density to be effective checks congestion control method is better than The result traditional.

Rate allocation has become a demanding task in data networks as diversity in users and traffics proliferate. Most commonly used algorithm in end hosts is TCP. This is a loss based scheme therefore it exhibits oscillatory behavior which reduces network performance. Moreover, since the price for all sessions is based on the aggregate throughput, losses that are caused by TCP affect other sessions as well and aggressively reduce their throughput and also have a drastic effect on the overall good put of the system. In this paper a new differentiated pricing method is proposed that not only reduces the loss phenomenon in the network, it improves the overall performance of the network and allows other sessions such as Proportional or Minimum Potential Delay schemes achieve more fair rates. Stability property of the algorithm is investigated and some numerical analysis is presented to verify the claims.

The TCP connection management protocol sets a position for a classic Denial of Service (DoS) attack, called the SYN flooding attack. In this attack attacker sends a large number of TCP SYN segments, without completing the third handshaking step to quickly exhaust connection resources of the victim server. Therefore it keeps TCP from handling legitimate requests. This paper proposes that SYN flooding attack can be viewed metaphorically as result of an unfair scheduling that gives more opportunity to attack requests but prevents legal connections from getting services. In this paper, we present a scheduling algorithm that ejects the half connection with the longest duration, when number of half open connections reaches to the upper bound. The simulation results show that the proposed defense mechanism improves performance of the under attack system in terms of loss probability of requests and share of regular connections from system resources.