An Effective Queue Management Scheme for Data Communication

Abstract

Problem statement: The growth in the needs of Internet applications that transmit massive amount of data has led to the emergence of Effective Queue Management. Approach: Queues were used to smooth spikes in incoming packet rates and to allow the router sufficient time for packet processing. When the waiting time is less a better queue management is ensured thereby resulting in increased flow in the queue. When the incoming packet rate was higher than the router's outgoing packet rate, the queue size was increased, eventually exceeding the available buffer space. With respect to     TCP’s RED queue management, the problem was that the buffer size was reduced to half and the packets were dropped abruptly. The congestion was detected early and the packets were dropped. The merit may be that congestion was detected early but the adverse effect was loss of packets. Results: The sender had to retransmit causing delay onto the network. This caused adverse effects on the network performance. In proposed system queue was extended whenever the number of packets present in the queue exceeds queue threshold. Packet drops were insignificantly even during network congestion. When the queue was continuously extended and if there was steady inflow of high volume of data, packet drop ratio was insignificant. Conclusions: Thus by the adoption of the proposed work, network throughput rose considerably thereby enabling effective data transfer. So it exhibits high bandwidth utilization, good throughput and processing time.