Research Article
Using Recurring Costs for Reputation Management in Peer-To-Peer Streaming Systems
@INPROCEEDINGS{10.1109/SECCOM.2007.4550345, author={Michael Rossberg and Guenter Schaefer and Thorsten Strufe}, title={Using Recurring Costs for Reputation Management in Peer-To-Peer Streaming Systems}, proceedings={3rd International ICST Conference on Security and Privacy in Communication Networks}, publisher={IEEE}, proceedings_a={SECURECOMM}, year={2008}, month={6}, keywords={Anonymity Client Puzzle Peer-To-Peer Privacy Recurring Costs Reputation Security}, doi={10.1109/SECCOM.2007.4550345} }- Michael Rossberg
Guenter Schaefer
Thorsten Strufe
Year: 2008
Using Recurring Costs for Reputation Management in Peer-To-Peer Streaming Systems
SECURECOMM
IEEE
DOI: 10.1109/SECCOM.2007.4550345
Abstract
Due to the dependency on preceding nodes in overlay live streaming systems, only highly reliable nodes should be chosen to occupy vital positions in the overlay topology, serving large numbers of succeeding participants. Otherwise, the highly dynamic and potentially hostile environment with frequent arrivals and departures of participants may lead to high packet loss rates and a significant decrease in quality of service. Hence, a high resilience towards failure of participants and especially deliberate sabotage through malicious parties is a prerequisite for this content distribution scheme to gain acceptance by users and the market. In order to incorporate the reliability of nodes into the topology construction process a stable metric for assessing the reliability of nodes has to be defined that preserves the anonymity of the subscribers and allows coping with their stochastic behavior. In this paper we present eLeumund, an algorithm, which utilizes recurring costs as a means to compute a dependable reputation value representing a node’s reliability for the service. Our scheme maintains the privacy of all participants.