Operational Models for Reputation Servers
نویسنده
چکیده
This paper devises a classification system for reputation systems based on two axes, namely: who performs the evaluation of a subject’s reputation, and how the information is collected by the reputation system. This leads to 4 possible operational models for reputation systems, termed the Voting Model, the Opinion Poll Model, the MP Model and the Research Model, each of which is then analyzed. Finally, the paper postulates the inherent trustworthiness of each operational model, and concludes with a hypothesis of how these systems might evolve in the future.
منابع مشابه
Security Threats of Collusion-based Linguistic Fuzzy Trust Model for WSN
In the last few years management of trust and reputation models over distributed systems has been proposed as a novel and accurate way of dealing with some security deficiencies which are inherent to distributed environments. Many models and theories have been designed in order to effective and accurately manage trust and reputation in those environments. Nevertheless, very few of them take int...
متن کاملHierarchical location-allocation models for congested systems
In this paper we address the issue of locating hierarchical facilities in the presence of congestion. Two hierarchical models are presented, where lower level servers attend requests first, and then, some of the served customers are referred to higher level servers. In the first model, the objective is to find the minimum number of servers and their locations that will cover a given region with...
متن کاملReputation Algebra for Cloud-based Anonymous Data Storage Systems
Given a cloud-based anonymous data storage system, there are two ways for managing the nodes involved in file transfers. One of them is using reputations and the other uses a micropayment system. In reputation-based approach, each node has a reputation associated with it, which is used as a currency or feedback collection for file exchange operations. There have been several attempts over the y...
متن کاملAlgorithmically Determining Store-and-Forward MTA Relays Using DomainKeys
Store-and-forward MTA relaying servers have frequently presented problems to various antispam techniques, such as IPbased reputation or email authentication. Algorithms that find email relaying servers can use knowledge about a domain’s outbound IP addresses combined with cryptographic domain authentication frameworks such as DomainKeys. This paper presents one such algorithm. 1.Why find relayi...
متن کاملUncheatable Reputation for Distributed Computation Markets
Reputation systems aggregate mutual feedback of interacting peers into a “reputation” metric for each participant. This is then available to prospective service “requesters” (clients) for the purpose of evaluation and subsequent selection of potential service “providers” (servers). For a reputation framework to be effective, it is paramount for both the individual feedback and the reputation st...
متن کامل