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

Author

Binzenhöfer, Andreas ; Kunzmann, Gerald ; Henjes, Robert

Author_Institution

Inst. of Comput. Sci., Wurzburg Univ.

fYear

2006

fDate

25-29 April 2006

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

Keywords

distributed algorithms; fault tolerant computing; peer-to-peer computing; system monitoring; chord-based p2p system monitoring; decentralized fault tolerant architecture; distributed algorithm; peer-to-peer systems; performance parameters; scalable algorithm; Bandwidth; Communication networks; Computer science; Computerized monitoring; Control systems; Costs; Debugging; Fault tolerant systems; Stability; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International

Conference_Location

Rhodes Island

Print_ISBN

1-4244-0054-6

Type

conf

DOI

10.1109/IPDPS.2006.1639710

Filename

1639710