A scalable algorithm to monitor chord-based P2P systems at runtime

Authors:
Andreas Binzenhöfer;Gerald Kunzmann;Robert Henjes
Affiliations:
University of Würzburg, Institute of Computer Science, Würzburg, Germany;Technische Universitaet Muenchen, Institute of Communication Networks, Munich, Germany;University of Würzburg, Institute of Computer Science, Würzburg, Germany
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 3
Cited 1

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
NetProfiler: profiling wide-area networks using peer cooperation

IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Comparing the performance of distributed hash tables under churn

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems

HELC: a High Efficiency and Low Cost structured Peer-to-Peer overlay without Distributed Hash Table

International Journal of Autonomous and Adaptive Communications Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Peer-to-peer (p2p) systems are a highly decentralized, fault tolerant, and cost effective alternative to the classic client-server architecture. Yet companies hesitate to use p2p algorithms to build new applications. Due to the decentralized nature of such a p2p system the carrier does not know anything about the current size, performance, and stability of its application. In this paper we present an entirely distributed and scalable algorithm to monitor a running p2p network. The snapshot of the system enables a telecommunication carrier to gather information about the current performance parameters of the running system as well as to react to discovered errors.