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.
%0 Report
%1 TR373
%A Binzenhöfer, Andreas
%A Kunzmann, Gerald
%A Henjes, Robert
%C Department of Computer Science
%D 2005
%K myown
%N 373
%T A Scalable Algorithm to Monitor Chord-based P2P Systems at Runtime.
%U http://www3.informatik.uni-wuerzburg.de/TR/tr373.pdf
%X 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.
@techreport{TR373,
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.
},
added-at = {2015-06-18T10:00:28.000+0200},
address = {Department of Computer Science},
author = {Binzenhöfer, Andreas and Kunzmann, Gerald and Henjes, Robert},
biburl = {https://www.bibsonomy.org/bibtex/22fbdf907f8aab992144ca289b78649fb/trcsuniwue},
interhash = {8b87b737956d1c03a8a20a6812662958},
intrahash = {2fbdf907f8aab992144ca289b78649fb},
keywords = {myown},
month = {November},
number = 373,
timestamp = {2015-06-18T10:00:28.000+0200},
title = {A Scalable Algorithm to Monitor Chord-based P2P Systems at Runtime.},
type = {Technical Report},
url = {http://www3.informatik.uni-wuerzburg.de/TR/tr373.pdf},
year = 2005
}