A Least-Resistance Path in Reasoning about Unstructured Overlay Networks

Authors:
Giorgos Georgiadis;Marina Papatriantafilou
Affiliations:
Department of Computer Science and Engineering, Chalmers University of Technology, Göteborg, Sweden S-412 96;Department of Computer Science and Engineering, Chalmers University of Technology, Göteborg, Sweden S-412 96
Venue:
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Year:
2009

Citing 12
Cited 0

The electrical resistance of a graph captures its commute and cover times

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing
Looking up data in P2P systems

Communications of the ACM
Mapping the Gnutella Network

IEEE Internet Computing
Exploiting Semantic Proximity in Peer-to-Peer Content Searching

FTDCS '04 Proceedings of the 10th IEEE International Workshop on Future Trends of Distributed Computing Systems
Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable

P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Fundamentals of Electric Circuits

Fundamentals of Electric Circuits
Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation

IEEE Transactions on Knowledge and Data Engineering
SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication

Proceedings of the 2007 inaugural international conference on Distributed event-based systems
How to Compute Times of Random Walks Based Distributed Algorithms

Fundamenta Informaticae
Combining the use of clustering and scale-free nature of user exchanges into a simple and efficient p2p system

Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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, currently there is a very limited selection of appropriate tools to use in 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 algorithms for peer-to-peer networks. One of the key features of this framework is that it enables us to measure and contrast the local and global impact of algorithmic decisions in peer-to-peer networks. We provide example experimental studies that furthermore demonstrate its capabilities in the overlay network context.