Optimizing unstructured peer-to-peer overlays with topology awareness

Hao Liao, Po Shen Yeh, Hung Chang Hsiao

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

Abstract

In an unstructured peer-to-peer (P2P) network (e.g., Gnutella), participating peers choose their neighbors randomly such that the resultant P2P network mismatches its underlying physical network, resulting in the lengthy communication between the peers and redundant network traffics generated in the underlying network. Previous solutions to the topology-mismatch problem in the literature are far from the optimum. In this paper, we propose a novel topology-matching algorithm based on the Metropolis-Hastings method. Through extensive simulations, we show that our proposal constructs an unstructured P2P network where a broadcast message, originated by any node v, reaches any other node u by taking approximately the only physical end-to-end delay between v and u.

Original languageEnglish
Title of host publicationICPADS '09 - 15th International Conference on Parallel and Distributed Systems
Pages746-751
Number of pages6
DOIs
Publication statusPublished - 2009 Dec 1
Event15th International Conference on Parallel and Distributed Systems, ICPADS '09 - Shenzhen, Guangdong, China
Duration: 2009 Dec 82009 Dec 11

Publication series

NameProceedings of the International Conference on Parallel and Distributed Systems - ICPADS
ISSN (Print)1521-9097

Other

Other15th International Conference on Parallel and Distributed Systems, ICPADS '09
CountryChina
CityShenzhen, Guangdong
Period09-12-0809-12-11

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Optimizing unstructured peer-to-peer overlays with topology awareness'. Together they form a unique fingerprint.

Cite this