An Algorithm for Adaptive Queue ManagementBased on Time to live field TTL

Abstract

Abstract Each Active Queue Management Algorithms aims to improve the performance of routers and thus improve the performance of the network in general. The goals of these Algorithms are avoiding congestion, reduce delays, and decrease (Bufferbload) and preservation of the channel capacity. So all attempts of Active Queue Management Algorithms aimed to drop the packets appropriately and determine the length of the queue properly as much as possible to achieve the desired goal of improving network performance. this project has invented a new algorithm called the (An Algorithm for adaptive queue management based on time-to-live field (TTL) in this algorithm the queue are arranged according to the (TTL) value, from the smallest to the biggest, so that the smaller value served first. This algorithm does not depend on the parameters used in most Active Queue Management Algorithms. But it relies on the packets, which spend the longest distance and the (round-trip time RTT) is barely to be completed, will be served first in order to reduce retransmitting the packet many time. Therefore retransmission of the packets many time lead to congestion. It is found that this algorithm reduces congestion, delays and preserves the channel capacity better than (IP QoS Priority Queuing) Algorithms.