search query: @keyword DHT / total: 16
reference: 9 / 16
« previous | next »
Author:Meriläinen, Markus
Title:Evaluating Chord for Peer-to-Peer Session Initiation Protocol
Chordin arvioimista Peer-to-Peer Session Initiation protokollaa varten
Publication type:Master's thesis
Publication year:2010
Pages:59      Language:   eng
Department/School:Informaatio- ja luonnontieteiden tiedekunta
Main subject:Tietokoneverkot   (T-110)
Supervisor:Ylä-Jääski, Antti
Instructor:Hautakorpi, Jani
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     | Archive
Keywords:P2PSIP
DHT
Chord
P2PSIP
DHT
Chord
Abstract (eng): Recent advances in Algorithm theory have made Peer-to-Peer based applications for social interaction a feasible alternative for the traditional centralised server based solutions.
A group of algorithms called distributed hash table (DHT) algorithms has been designed to provide solution how data can be systematically stored and retrieved to a distributed set of nodes of the overlay.

This study evaluates one of the most popular DHT algorithms, Chord, from theoretical perspective and based on performance measurements.
A special focus is put on the features, that are important for the Peer-to-Peer SIP (P2PSIP) application usage.
Chord is compared to two other popular DHT algorithms CAN and Kademlia, which also perform lookups in log (n) time.
Other aspects related to building a working P2PSIP software, such as how DHT algorithms can be evaluated, good characteristics for the Peer protocol and implementability of the algorithm, are also discussed.

The implementability of the Chord was studied by building a prototype application based on the Chord and one of the candidates for a P2PSIP Peer protocol, the Peer-to-Peer Protocol (P2PP).
This thesis presents the design and implementation of the prototype and analyses the performance of Chord in the light of the measurements that were done using the prototype.
Based on the evaluation, Chord was found to be logical to be implemented and well suited to be used in P2PSIP applications.
Abstract (fin): Viimeaikaiset edistysaskeleet algoritmitutkimuksessa ovat tehneet vertaisverkkoihin perustuvien sosiaalisten kommunikaatiosovellusten kehittämisestä hyvän vaihtoehdon perinteisten keskitettyjen palvelinpohjaisien ratkaisujen käyttämiselle.
Ryhmä algoritmeja, joita kutsutaan hajautettu tiiviste (DHT) algoritmeiksi, tarjoavat ratkaisun kuinka dataa voidaan systemaattisesti tallentaa ja noutaa hajautetusta joukosta verkon solmuja.

Tämä tutkimus analysoi yhden suositun DHT algoritmin nimeltä Chord, teoreettisten ja mitattujen ominaisuuksien pohjalta.
Arvioinnissa on erityisesti otettu huomioon algoritmin soveltuvuus käytettäväksi vertaisverkko SIP (P2PSIP) sovelluksissa.
Chordia on verrattu kahteen muuhun suosittuun DHT algoritmiin CAN ja Kademlia, jotka myös suorittavat hakuja log (n) ajassa.
Työssä on pohdittu myös muita toimivan P2PSIP sovelluksen rakentamisessa vaadittavia asioita, kuten hyvän Peer protokollan ominaisuuksia ja algoritmin toteutettavuutta.

Chordin toteutettavuutta tutkittiin rakentamalla prototyyppisovellus joka toteuttaa Chordin ja yhden P2PSIP Peer protokolla ehdokkaan, vertaisverkko protokollan (P2PP).
Tämä työ esittelee prototyypin arkkitehtuurin ja toteutuksen, sekä analysoi Chordin suorituskykyä prototyypin avulla tehtyjen mittausten valossa.
Analyysin perusteella Chordin on todettu olevan looginen toteuttaa ja sen on todettu sopivan hyvin käytettäväksi P2PSIP sovelluksissa.
ED:2010-02-05
INSSI record number: 38878
+ add basket
« previous | next »
INSSI