search query: @keyword throughput / total: 18
reference: 8 / 18
« previous | next »
Author:Ropponen, Lasse
Title:Ruuhkanhallinta-algoritmien toiminta haasteellisissa tietoverkoissa
Congestion control algorithms in challenging networks
Publication type:Master's thesis
Publication year:2010
Pages:[7] + 47      Language:   fin
Department/School:Tietoliikenne- ja tietoverkkotekniikan laitos
Main subject:Tietoverkkotekniikka   (S-38)
Supervisor:Manner, Jukka
Instructor:Siikavirta, Sebastian
Electronic version URL: http://urn.fi/URN:NBN:fi:aalto-201203131448
OEVS:
Electronic archive copy is available via Aalto Thesis Database.
Instructions

Reading digital theses in the closed network of the Aalto University Harald Herlin Learning Centre

In the closed network of Learning Centre you can read digital and digitized theses not available in the open network.

The Learning Centre contact details and opening hours: https://learningcentre.aalto.fi/en/harald-herlin-learning-centre/

You can read theses on the Learning Centre customer computers, which are available on all floors.

Logging on to the customer computers

  • Aalto University staff members log on to the customer computer using the Aalto username and password.
  • Other customers log on using a shared username and password.

Opening a thesis

  • On the desktop of the customer computers, you will find an icon titled:

    Aalto Thesis Database

  • Click on the icon to search for and open the thesis you are looking for from Aaltodoc database. You can find the thesis file by clicking the link on the OEV or OEVS field.

Reading the thesis

  • You can either print the thesis or read it on the customer computer screen.
  • You cannot save the thesis file on a flash drive or email it.
  • You cannot copy text or images from the file.
  • You cannot edit the file.

Printing the thesis

  • You can print the thesis for your personal study or research use.
  • Aalto University students and staff members may print black-and-white prints on the PrintingPoint devices when using the computer with personal Aalto username and password. Color printing is possible using the printer u90203-psc3, which is located near the customer service. Color printing is subject to a charge to Aalto University students and staff members.
  • Other customers can use the printer u90203-psc3. All printing is subject to a charge to non-University members.
Location:P1 Ark Aalto  1345   | Archive
Keywords:congestion control
congestion avoidance
simulation
throughput
ruuhkanhallinta-algoritmi
TCP
DCCP
simulointi
pakettihukka
ns2
läpivienti
Abstract (fin): The focus of this Master's thesis is to research the behaviour of different congestion control algorithms by different packet drop and latency values.
Seven different transport layer protocol variants were researched.
Five of them were TCP variants and two DCCP variants.
Used research method was systematic simulation that was performed by Ns2-simulator.

Congestion control algorithms try to avoid congestion and permit as efficient usage of the network as possible.
Congestion control algorithms are also responsible about the fairness between different network users.
Selfish and aggressive network protocol may seem efficient from its own perspective but for the overall efficiency such behaviour is questionable.

Congestion control is based on noticing and reacting for congestion by tuning the transfer rate.
There are many different methods to become aware of congestion but all of them are incapable to distinguish the reason for the interference at the transmission.
The most common indication about congestion is a packet loss.
Unfortunately there is no mechanism to know exactly the reason for the packet loss.
Ali indications about congestion cause same congestion control behaviour and therefore algorithms may sometimes react incorrectly.
A good example about this is an uncongested wireless network which has high packet drop rate.

The simulations were divided into two parts.
At the first part the good put of different TCP and DCCP variants through an uncongested bottleneck 1mk was researched by computer simulations.
At the second part of the simulations the fairness of different TCP and DCCP variants at a bottleneck 1mk were researched.
ED:2010-08-12
INSSI record number: 40090
+ add basket
« previous | next »
INSSI