Design and analysis of a scalable algorithm to monitor chord‐based p2p systems at runtime

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. Copyright © 2007 John Wiley & Sons, Ltd.

[1]  Jason Lee,et al.  Monitoring, Analyzing, and Controlling Internet-scale Systems with ACME , 2004, ArXiv.

[2]  Robert Tappan Morris,et al.  Comparing the Performance of Distributed Hash Tables Under Churn , 2004, IPTPS.

[3]  Daniel Stutzbach,et al.  Capturing Accurate Snapshots of the Gnutella Network , 2005, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[4]  Gerald Kunzmann,et al.  A scalable algorithm to monitor chord-based P2P systems at runtime , 2006, IPDPS.

[5]  Sriram Ramabhadran,et al.  NetProfiler: Profiling Wide-Area Networks Using Peer Cooperation , 2005, IPTPS.

[6]  J. Eberspacher,et al.  Increasing the reliability of structured P2P networks , 2005, DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005..

[7]  Atul Singh,et al.  Using queries for distributed monitoring and forensics , 2006, EuroSys.

[8]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.