Academic Journals Database
Disseminating quality controlled scientific knowledge

Packet Loss Control using Early Random Control at the Network Edge

ADD TO MY LIST
 
Author(s): G. Srinivasa Rao

Journal: International Journal of Engineering Trends and Technology
ISSN 2231-5381

Volume: 4;
Issue: 5;
Start page: 1954;
Date: 2013;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: Bandwidth | Time Complexity | Space Complexity | Active flows.

ABSTRACT
This paper discusses the use of link-sharing mechanisms in packet networks and presents algorithms for hierarchical link-sharing. Hierarchical link-sharing allows multiple agencies, protocol families, or traffic types to share the bandwidth on a link in a controlled fashion. This paper presents Random Early Detection (RED) gateways for congestion avoidance in packets witched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gateway or by setting a bit in packet headers. We propose fair adaptive bandwidth allocation (FABA), a buffer management discipline that ensures a fair bandwidth allocation amongst competing flows even in the presence of non-adaptive traffic. The RED gateway has no bias against bursty traffic and avoids the global synchronization of many connections decreasing their window at the same time. Simulations of a TCP/IP network are used to illustrate the performance of RED gateways.

Tango Jona
Tangokurs Rapperswil-Jona

     Save time & money - Smart Internet Solutions