Performance comparison of AutoRED under different TCP Variations

摘要

Chaotic queue oscillation is a major problem at the Internet Routers that use Random Early Detection (RED) scheme to control network traffic congestion. The chaotic queue oscillation occurs due to slowly varying average queue size in RED based schemes. Several improved versions of RED and alterative techniques have been proposed in the networking literature to control network traffic congestion. All these techniques still suffer from the chaotic queue oscillation especially in heavily congested networks. AutoRED scheme has been proposed recently to control queue oscillations. In this paper we evaluate the performance of AutoRED versus few other congestion control techniques under different TCP versions and congestion scenarios. We use throughput, throughput gain, packet loss rate and newly defined average queuing delay as a performance metrics (QoS) in these experiments. Our finding is that the AutoRED algorithm significantly reduces the chaotic queue oscillations and gives a predictable low delay and a low delay jitter with high throughput gain and reduced packet loss rate under Transmission Control Protocols (TCP) called Tahoe, Reno, NewReno and Vegas.