A Least-Resistance Path in Reasoning about Unstructured Overlay Networks

Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and inherent fault-tolerance and self-organizing properties. Moreover, there is a relatively large volume of experimental evidence that these methods are efficiency-wise a good alternative to structured methods, which require more sophisticated algorithms for maintenance and fault tolerance. However, currentlythereisaverylimitedselectionofappropriatetools tousein systematically evaluating performance and other properties of such non-trivial methods. Based on a well-known association between random walks and resistor networks, and building on a recently pointed-out connection with peer-to-peer networks, we tie-in a set of diverse techniques and metrics of both realms in a unifying framework. Furthermore, we present a basic set of tools to facilitate the analysis of overlay properties and the reasoning about algor...

• Type: Journal
• Year: 2009
• Where: EUROPAR
• Authors: Giorgos Georgiadis, Marina Papatriantafilou
• Keywords: Distributed And Parallel Computing, EUROPAR 2009, Overlay Network, Peer-to-peer Networks, Unstructured Overlay Networks