On the cost-ineffectiveness of redundancy in commercial P2P computing

Yurkewych, M.; Levine, Brian Neil; Rosenberg, Arnold L.

doi:10.1145/1102120.1102157

Cited by 24 publications

(30 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the realm of collusion characterization, prior works include group-based agreement techniques [8], the use of checkpoints (trickle messages) for incremental checking [15], game theoretic approaches [16], graph clustering techniques [17], and detection of errors in dependent task chains [18]. However, these papers do not address the task allocation problem in the presence of collusion.…”

Section: Related Workmentioning

confidence: 99%

A Scheduling and Certification Algorithm for Defeating Collusion in Desktop Grids

Canon

Jeannot

Weissman

2011

2011 31st International Conference on Distributed Computing Systems

View full text Add to dashboard Cite

Abstract-By exploiting idle time on volunteer machines, desktop grids provide a way to execute large sets of tasks with negligible maintenance and low cost. Although desktop grids are attractive for their scalability and low cost, relying on external resources may compromise the correctness of application execution due to the well-known unreliability of nodes. In this paper, we consider a very challenging threat model: correlated errors caused either by organized groups of cheaters that may collude to produce incorrect results, or by buggy or so-called "unofficial" clients. By using a previously described on-line algorithm for detecting collusion and characterizing the participant behaviors, we propose a scheduling and result certification algorithm that tackles collusion. Using several real-life traces, we show that our approach minimizes both replication overhead and the number of incorrectly certified results.

show abstract

Section: Related Workmentioning

confidence: 99%

A Scheduling and Certification Algorithm for Defeating Collusion in Desktop Grids

Canon

Jeannot

Weissman

2011

2011 31st International Conference on Distributed Computing Systems

View full text Add to dashboard Cite

show abstract

“…However, Internetbased computing (referred sometimes as P2P computing-P2PC [13], [39]) has not reached its full potential due to the untrustworthy nature of the platform's components [3], [16]. Typically, in Internet-based computing (e.g., in SETI) the following Master-Worker approach is employed: A master computer sends jobs or tasks, across the Internet, to worker computers that are willing to execute them.…”

Section: A Motivation and Prior Workmentioning

confidence: 99%

Algorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workers

Anta

Georgiou

Mosteiro

2010

2010 IEEE International Symposium on Parallel &Amp; Distributed Processing (IPDPS)

View full text Add to dashboard Cite

Abstract-We consider Internet-based master-worker computations, where a master processor assigns, across the Internet, a computational task to a set of untrusted worker processors, and collects their responses; examples of such computations are the "@home" projects such as SETI. Prior work dealing with Internet-based task computations has either considered only rational, or only malicious and altruistic workers. Altruistic workers always return the correct result of the task, malicious workers always return an incorrect result, and rational workers act based on their self-interest. However, in a massive computation platform, such as the Internet, it is expected that all three type of workers coexist. Therefore, in this work we study Internet-based master-worker computations in the presence of Malicious, Altruistic, and Rational workers. A stochastic distribution of the workers over the three types is assumed. Considering all the three types of workers renders a combination of game-theoretic and classical distributed computing approaches to the design of mechanisms for reliable Internet-based computing. Indeed, in this work, such an algorithmic mechanism that makes use of realistic incentives to obtain the correct task result with a parametrized probability is designed. Only when necessary, the incentives are used to force the rational players to a certain equilibrium (which forces the workers to be truthful) that overcomes the attempts of the malicious workers to deceive the master. Finally, the mechanism is analyzed in two realistic Internet-based master-worker applications. This work is an example of how game theory can be used as a tool to formalize and solve a practical Distributed Computing problem such as Internet supercomputing.

show abstract

“…Ensuring that quiz tasks are indistinguishable from regular tasks, however, is a difficult problem. Similarly, Yurkewych, Levine, and Rosenberg propose a way to estimate the cost of a redundancy mechanism in the presence of colluders using game theory (see [9]). In this work, the goal is to determine the probability of auditing a task that minimizes the risk of collusion.…”

Section: Related Workmentioning

confidence: 99%

A dynamic approach for characterizing collusion in desktop grids

Canon

Jeannot

Weissman

2010

2010 IEEE International Symposium on Parallel &Amp; Distributed Processing (IPDPS)

View full text Add to dashboard Cite

Abstract-By exploiting idle time on volunteer machines, desktop grids provide a way to execute large sets of tasks with negligible maintenance and low cost. Although desktop grids are attractive for cost-conscious projects, relying on external resources may compromise the correctness of application execution due to the wellknown unreliability of nodes. In this paper, we consider the most challenging threat model: organized groups of cheaters that may collude to produce incorrect results. We propose two on-line algorithms for detecting collusion and characterizing the participant behaviors. Using several real-life traces, we show that our approach is accurate and efficient in identifying collusion and in estimating group behavior.

show abstract

On the cost-ineffectiveness of redundancy in commercial P2P computing

Cited by 24 publications

References 21 publications

A Scheduling and Certification Algorithm for Defeating Collusion in Desktop Grids

A Scheduling and Certification Algorithm for Defeating Collusion in Desktop Grids

Algorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workers

A dynamic approach for characterizing collusion in desktop grids

Contact Info

Product

Resources

About