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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageUnknown
Title of host publicationCRC
PublisherInstituto Superior T馗nico
Pages1-6
Volume2009
ISBN (Print)978-989-20-1736-5
Publication statusPublished - 1 Jan 2009
EventConferência de Redes de Computadores 2009 (CRC'2009) -
Duration: 1 Jan 2009 → …

Conference

ConferenceConferência de Redes de Computadores 2009 (CRC'2009)
Period1/01/09 → …

Cite this