search query: @keyword TCP / total: 40
reference: 7 / 40
« previous | next »
Author:Salo, Jaakko
Title:Packet loss tolerant stream transport protocol
Häviösietoinen tiedonsiirtoprotokolla
Publication type:Master's thesis
Publication year:2014
Pages:vii + 70      Language:   eng
Department/School:Tietotekniikan laitos
Main subject:Tietokoneverkot   (T-110)
Supervisor:Aura, Tuomas
Instructor:Kalliola, Aapo
Electronic version URL: http://urn.fi/URN:NBN:fi:aalto-201507013721
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  1769   | Archive
Keywords:denial-of-service
linear code
network coding
congestion control
palvelunestohyökkäykset
lineaarinen koodi
TCP
ruuhkanhallinta
Abstract (eng): Commonly used TCP congestion control algorithms may not be reasonable under lossy network conditions.
We present a stream transport protocol designed to work under these conditions, with emphasis on volumetric Layer 3 denial-of-service attacks.

Our approach is based on generating linear codes over a binary extension field, replacing the retransmission scheme in typical TCP implementations.
A recipient can decode a number of plain data segments when enough linearly independent code symbols have been acquired.

We present experiment results using our implementation in a laboratory network with a simple topology.
We alter round-trip time and packet loss in the test network to simulate difficult network conditions.

We find that the coding scheme is CPU intensive when send rate, packet loss or round-trip time increase.
We present analysis of how these variables affect the computational complexity, and propose a number of approaches to limiting the complexity.

The experiment results show our implementation reaches nearly optimal end-to-end application throughput.
Abstract (fin): Yleisesti käytetyt algoritmit TCP:n ruuhkanhallintaan eivät sovellu kaikkiin tilanteisiin, joissa verkon pakettihäviö on suurta.
Esitämme protokollan tavuvirtojen luotettavaan siirtoon tällaisissa tilanteissa, keskittyen erityisesti Layer 3 palvelunestohyökkäyksiin.

Ratkaisumme perustuu lineaariseen kooditukseen tulkitsemalla lähetettävät datapaketit elementteinä äärellisessä binaarikunnassa.
Nain korvataan TCP:n tavanomainen uudelleenlähetykseen perustuva virheenkorjaus.
Vastaanottaja pystyy purkamaan alkuperäiset datapaketit vastaanotettuaan riittävän määrän lineaarisesti riippumattomia koodisymboleja.

Toteutimme koejärjestelyn, jossa simuloitiin palvelunestohyökkäyksiä.
Käytimme yksinkertaista verkkotopologiaa, jossa aiheutimme ruuhkaa ja pakettien kiertoajan (RTT) kasvua.
Esitämme koejärjestelyn tulokset.

Koodien generointi vaatii enenevästi prosessoriaikaa lähetysnopeuden, pakettihäviön sekä verkon kiertoajan kasvaessa.
Analysoimme, kuinka nämä parametrit vaikuttavat koodituksen laskennalliseen vaativuuteen.
Esitämme ratkaisuja laskennallisen vaativuuden hallintaan.

Tuloksemme osoittavat, kuinka toteutuksemme saavuttaa lähes optimaalisen sovellusten välisen tiedonsiirtonopeuden.
ED:2014-07-01
INSSI record number: 49358
+ add basket
« previous | next »
INSSI