Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The RED Algorithm – Averaged Queue Weight Modeling for Non Linear Traffic
Blekinge Institute of Technology, School of Computing.
Blekinge Institute of Technology, School of Computing.
Blekinge Institute of Technology, School of Computing.
2010 (English)Independent thesis Advanced level (degree of Master (Two Years))Student thesis
Abstract [en]

This thesis presents an approach in developing a congestion avoidance algorithm in computer networks for router-based communication. In internet communications, the requests generated are transferred through network nodes called routers which routes information, from one node to another, depending upon the request made. As the traffic load increases in the communication links, the routers must be designed to provide fair traffic flows, from a source to a destination, for all network nodes. During heavy traffic conditions the routers may get congested and the traffic flow through such a router degrades rapidly resulting in heavy packet dropping. Furthermore, this fact may also lead to a complete traffic collapse. To achieve fair transportation through such routers, the routers must be designed and provisioned with advanced congestion avoidance algorithms in order to achieve good performance. Congestion avoidance algorithms were used in the past, e.g. Active Queue Management (AQM), or the Drop Tail (DT) algorithm. To reduce the congestion effect, a new congestion avoidance algorithm named Random Early Detection (RED) was suggested. In RED, the calculation of packet dropping probabilities uses a queue weight factor. When compared to the previous RED approach, a fixed value is assigned leading to constant congestion reduction and if the network is varied randomly this fixed value may result in over congestion. To avoid this, an average queue weight parameter is developed. This algorithm is evaluated on router architecture for its practical feasibility and this mechanism is evaluated for various quality metrics such as throughput, network overhead, congestion level, transportation delay, etc. Due to its high cost in implementation on the network side, the proposed RED algorithm is evaluated through simulations and the obtained results are used to illustrate the performance of RED-DT by using MATLAB version 7.4.

Place, publisher, year, edition, pages
2010. , 65 p.
Keyword [en]
RED, DT, AQM
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:bth-4376Local ID: oai:bth.se:arkivex3A85E47FC619DAB0C12576AA0035B6BCOAI: oai:DiVA.org:bth-4376DiVA: diva2:831714
Uppsok
Technology
Supervisors
Note
0046737313431Available from: 2015-04-22 Created: 2010-01-13 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(841 kB)1620 downloads
File information
File name FULLTEXT01.pdfFile size 841 kBChecksum SHA-512
559bb26e2f956dc0a6eb3984ce79f0aeb6ae32b63e2548bb39fe9100316fc025213a523fef904da8066c91aa88b12571956ad49c9ed1028b5c7c0f21c1ca24f1
Type fulltextMimetype application/pdf

By organisation
School of Computing
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar
Total: 1620 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 45 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf