Design of Congestion Prevention Algorithms in Computer Networks
Journal: International Journal of Science and Research (IJSR) (Vol.2, No. 4)Publication Date: 2013-04-05
Authors : Vinod Babu Vellank; Suresh Angadi;
Page : 436-441
Keywords : Increase decrease algorithms; flow control; congestion control; feedback system;
Abstract
Congestion is said to occur in the network when the resource demands exceed the capacity and packets are lost due to too much queuing in the network. A congestion avoidance scheme allows a network to operate in the region of low delay and high throughput. Such schemes prevent a network from entering the congested state. Congestion avoidance is a prevention mechanism while congestion control is a recovery mechanism. We compare the concept of congestion avoidance with that of flow control and congestion control. We model the network and the user policies for congestion avoidance as a feedback control system. The key components of a generic congestion avoidance scheme are: congestion detection, congestion feedback, feedback selector, signal filter, decision function, and in-crease/decrease algorithms. These components have been explained.
Other Latest Articles
- Latest Technologies in Surface Computing
- Signal Jamming and its Modern Applications
- Synthesis and Antimicrobial Activity of Nove fused 4-(3H) Quinazolinone Derivatives
- Integration Satellite Multi Resolution Image Data Using Wavelet Transform to Identify Soil Moisture Dynamics at Lampung Tengah, Indonesia
- Performance Characteristics of Rectangular Patch Antenna
Last modified: 2021-06-30 20:15:34