A COngestion Control Algorithm for Improving Internet Traffic Control

With the development of multiple services on Internet, the dominant Internet congestion control scheme, namely the TCP end-to-end control [16], becomes insufficient. The RED algorithm [14] to detect incipient congestion early and to convey congestion notification to the end hosts, in order to allow them to reduce their transmission rates before queue overflow and packet loss occur using active queue management [15]. On-line mechanism for adaptively changing the parameters according to the observed traffic. This algorithm, called Adaptive RED. This paper also presents completely different architecture, which avoids congestion [1], prevents packet loss, and regulates unresponsive traffic in a uniform fashion. No per-flow state information is maintained in routes while the fairness is guaranteed. The new architecture takes a node-to-node approach advocating close coordination among the core router, the edge router, and the host. Employing both router and host mechanisms, it has three main elements, the generic congestion control protocol (GCCP), the early congestion detector, and the rate controller. The revised version of RED, called GCCP-Ramachandra. V.Pujeri, Assistant Professor, is with the Department of CSE, PSG College of Technology, Coimbatore, TamilNadu India. (e-mail: sriramu_vp@yahoo.com). Uma.K.Gurav, UG Student, is with the Department of CSE, Lokamanya Tilak Institute of Technology, New Mumbai, India. S.N.Sivanandam, Professor and Head, is with the Department of CSE, PSG College of Technology, Coimbatore, TamilNadu India.