search query: @keyword congestion pricing / total: 3
reference: 1 / 3
« previous | next »
Author:Moktan, Gautam Raj
Title:Flow-length dependent congestion control
Publication type:Master's thesis
Publication year:2011
Pages:[8] + 55      Language:   eng
Department/School:Tietoliikenne- ja tietoverkkotekniikan laitos
Main subject:Tietoverkkotekniikka   (S-38)
Supervisor:Manner, Jukka
Instructor:Siikavirta, Sebastian
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  1228   | Archive
Keywords:congestion control
congestion pricing
aggressive TCP
TCP fairness
flow-length dependent TCP
internet
Abstract (eng): Network conditions and traffic requirements of the Internet have been dynamically changing.
These changes arise from varying application and user demands from basic web browsing to peer-to-peer applications, server farms, satellite navigation, telecommunication networks, ad-hoc networks and others.
Various congestion control mechanisms have been developed to optimize the performance of TCP under such different conditions.

This work provides a new TCP congestion control mechanism for supporting the acceleration of shorter TCP flows over longer ones.
Two primary motivations exist for such implementation.
Firstly, more than 95th percentile of Internet traffic flows is short (< 2MB).
Mobile users tend to have even more short flows.
Secondly, for wireless devices, the energy consumption is directly proportional to the amount of time their radio interfaces remain open for transmission.
Good amount of energy can be saved by finishing flows faster.

Our proposed congestion control algorithm is more aggressive than the traditional algorithms at the beginning of the flow and less aggressive if the flow continues for long period of time.
The algorithm switches from the aggressive mode to the laid back mode after a threshold is crossed.
This threshold has been inferred from the current Internet statistics.
Algorithm is proven to accelerate small flows without significantly affecting the longer ones.
All analysis is conducted with NS-2.

We also have a mathematical model for a similarly behaving algorithm which adjusts the aggressiveness dynamically depending on the flow-length.
Aggressiveness of the congestion control algorithm is set to be a function of flow-length in bytes.
We are able to finish shorter flows almost twice as fast than normal TCP without causing significant disadvantage to longer flows.
Thus in this thesis, we describe the motivation for such algorithm, design two solutions and perform various experiments to see the implications of our concepts.
ED:2011-09-12
INSSI record number: 42734
+ add basket
« previous | next »
INSSI