A Scalable Algorithm to Monitor Chord-based P2P Systems at Runtime
Andreas Binzenhöfer, Gerald Kunzmann, and Robert Henjes
Research Report 371
Abstract
Peer-to-peer (p2p) systems are a highly decentralized, fault tolerant, and cost effective alternative to the classical 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.