Please use this identifier to cite or link to this item:
|Title:||CONGESTION AVOIDANCE USING RANDOM EARLY DETECTION GATEWAYS|
|Authors:||Rao, D. Venkateswara|
|Keywords:||ELECTRONICS AND COMPUTER ENGINEERING;CONGESTION AVOIDANCE;RANDOM EARLY DETECTION GATEWAYS;TCP TRANSPORT PROTOCOL|
|Abstract:||Currently in the Internet, the TCP transport protocol detects congestion only after a packet has been dropped at the gateway. However, it would clearly be undesirable to have large queues that are full most of the time, this would significantly increase the average delay in the network. In this dissertation, Random Early Detection gateway is used to detect incipient congestion by computing the average queue size, when the queue size exceeds a present threshold. The gateway drops or marks each arriving packet with a certain probability, where the exact probability is a function of average queue size. Random Early Detection gateway algorithm is implemented which has two phases. In the first phase, the algorithm for computing the average queue size determines the degree of burstiness that will be allowed in the gateway queue. In the second phase, an algorithm for calculating the packet marking probability determines how frequently the gateway marks packets at fairly marked intervals, in order to avoid biases and global synchronization. The implementation of Random Early Detection gateway is done in C++ language under Linux 6.1 environment on Pentium PC and simulations of the TCP/IP networks are used to illustrate the performance.|
|Research Supervisor/ Guide:||Garg, Kumkum|
|Appears in Collections:||MASTERS' THESES (E & C)|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.