Optimização de algoritmos P2P através de sistemas de coordenadas de rede - Um estudo de caso

José Augusto Legatheaux Martins; Sérgio Marco Duarte

Optimização de algoritmos P2P através de sistemas de coordenadas de rede - Um estudo de caso

José Augusto Legatheaux Martins, Sérgio Marco Duarte

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

This paper presents a comparative study on how well known synthetic network-coordinates algorithms (namely, GNP and Vivaldi) can be used to optimize a P2P algorithm. The algorithm being optimized allows a great deal of freedom in choosing each node’s partners, thus enabling network-coordinates systems to provide their best possible optimization.

The coordinates based variants of the algorithm are also compared with an almost optimal one, as well as with a version where partners are randomly chosen. The study highlights the pros and cons of the different algorithms and gives some hints of when their usage should be considered.

Original language	Unknown
Title of host publication	CRC
Publisher	Instituto Superior T馗nico
Pages	1-6
Volume	2009
ISBN (Print)	978-989-20-1736-5
Publication status	Published - 1 Jan 2009
Event	Conferência de Redes de Computadores 2009 (CRC'2009) - Duration: 1 Jan 2009 → …

Conference

Conference	Conferência de Redes de Computadores 2009 (CRC'2009)
Period	1/01/09 → …

Cite this

@inproceedings{c6f9058c0371468c836efd1d548bf464,

title = "Optimiza{\c c}{\~a}o de algoritmos P2P atrav{\'e}s de sistemas de coordenadas de rede - Um estudo de caso",

abstract = "This paper presents a comparative study on how well known synthetic network-coordinates algorithms (namely, GNP and Vivaldi) can be used to optimize a P2P algorithm. The algorithm being optimized allows a great deal of freedom in choosing each node{\textquoteright}s partners, thus enabling network-coordinates systems to provide their best possible optimization. The coordinates based variants of the algorithm are also compared with an almost optimal one, as well as with a version where partners are randomly chosen. The study highlights the pros and cons of the different algorithms and gives some hints of when their usage should be considered.",

keywords = "Algorithms, Network-Coordinates, Diffusion, P2P",

author = "Martins, {Jos{\'e} Augusto Legatheaux} and Duarte, {S{\'e}rgio Marco}",

year = "2009",

month = jan,

day = "1",

language = "Unknown",

isbn = "978-989-20-1736-5",

volume = "2009",

pages = "1--6",

booktitle = "CRC",

publisher = "Instituto Superior T馗nico",

note = "null ; Conference date: 01-01-2009",

}

TY - GEN

T1 - Optimização de algoritmos P2P através de sistemas de coordenadas de rede - Um estudo de caso

AU - Martins, José Augusto Legatheaux

AU - Duarte, Sérgio Marco

PY - 2009/1/1

Y1 - 2009/1/1

N2 - This paper presents a comparative study on how well known synthetic network-coordinates algorithms (namely, GNP and Vivaldi) can be used to optimize a P2P algorithm. The algorithm being optimized allows a great deal of freedom in choosing each node’s partners, thus enabling network-coordinates systems to provide their best possible optimization. The coordinates based variants of the algorithm are also compared with an almost optimal one, as well as with a version where partners are randomly chosen. The study highlights the pros and cons of the different algorithms and gives some hints of when their usage should be considered.

AB - This paper presents a comparative study on how well known synthetic network-coordinates algorithms (namely, GNP and Vivaldi) can be used to optimize a P2P algorithm. The algorithm being optimized allows a great deal of freedom in choosing each node’s partners, thus enabling network-coordinates systems to provide their best possible optimization. The coordinates based variants of the algorithm are also compared with an almost optimal one, as well as with a version where partners are randomly chosen. The study highlights the pros and cons of the different algorithms and gives some hints of when their usage should be considered.

KW - Algorithms

KW - Network-Coordinates

KW - Diffusion

KW - P2P

M3 - Conference contribution

SN - 978-989-20-1736-5

VL - 2009

SP - 1

EP - 6

BT - CRC

PB - Instituto Superior T馗nico

Y2 - 1 January 2009

ER -