A distributed topology-aware overlays construction algorithm

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Peer-to-Peer (P2P) computing systems are rapidly growing in importance as the medium of choice for the mass storage. Peers in the most P2P systems randomly choose logical neighbors without any knowledge about underlying physical topology. This mechanism can cause a serious topology mismatch between the P2P overlay network and the underlying network. It greatly limits the performance gain from various search or routing techniques. In this paper, a distributed topology-aware overlays construction algorithm Taonet is proposed, in which the overlay network construction is based on the location information of underlying topology. The nodes that are close in the logical network are also close in terms of network latency. This leads to low latency stretch of the overlay network. This algorithm is scalable and distributed. Simulation results indicate that the latency of data location in these topology-aware P2P systems that are constructed with Taonet can be significantly decreased.

Original languageEnglish
Title of host publicationProceedings of the 15th ACM Mardi Gras Conference, MG '08
DOIs
StatePublished - 2008
Event15th ACM Mardi Gras Conference, MG '08 - Baton Rouge, LA, United States
Duration: 29 Jan 20083 Feb 2008

Publication series

NameACM International Conference Proceeding Series
Volume320

Conference

Conference15th ACM Mardi Gras Conference, MG '08
Country/TerritoryUnited States
CityBaton Rouge, LA
Period29/01/083/02/08

Fingerprint

Dive into the research topics of 'A distributed topology-aware overlays construction algorithm'. Together they form a unique fingerprint.

Cite this