Show simple item record

dc.contributor.authorFernández Anta, Antonioen
dc.contributor.authorGeorgiou, Chryssisen
dc.contributor.authorMosteiro, Miguel A.en
dc.creatorFernández Anta, Antonioen
dc.creatorGeorgiou, Chryssisen
dc.creatorMosteiro, Miguel A.en
dc.description.abstractWe 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 responsesen
dc.description.abstractexamples 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 super computing. ©2010 IEEE.en
dc.sourceProceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2010en
dc.source24th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2010en
dc.subjectGame theoryen
dc.subjectInternet baseden
dc.subjectDistributed parameter networksen
dc.subjectMachine designen
dc.subjectInternet based computingen
dc.subjectInternet-based computingen
dc.subjectComputational tasken
dc.subjectMaster processoren
dc.subjectStochastic distributionen
dc.subjectTask executionen
dc.subjectTask executionsen
dc.subjectAlgorithmic mechanismen
dc.subjectAltruistic and malicious processorsen
dc.subjectDistributed Computingen
dc.subjectMaster-worker applicationsen
dc.subjectSuper computingen
dc.subjectVolunteering computingen
dc.titleAlgorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workersen
dc.identifier.doi10.1109/IPDPS.2010.5470409 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied SciencesΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeConference Objecten
dc.description.notes<p>Conference code: 80843en
dc.description.notesCited By :12</p>en
dc.contributor.orcidGeorgiou, Chryssis [0000-0003-4360-0260]
dc.contributor.orcidFernández Anta, Antonio [0000-0001-6501-2377]

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record