Show simple item record

dc.contributor.authorChristoforou, Evgeniaen
dc.contributor.authorFernández Anta, Antonioen
dc.contributor.authorGeorgiou, Chryssisen
dc.contributor.authorMosteiro, Miguel A.en
dc.contributor.editor-Gallet C.D.en
dc.contributor.editorAbdulla P.A.en
dc.creatorChristoforou, Evgeniaen
dc.creatorFernández Anta, Antonioen
dc.creatorGeorgiou, Chryssisen
dc.creatorMosteiro, Miguel A.en
dc.description.abstractThe assignment and execution of tasks over the Internet is an inexpensive solution in contrast with supercomputers. We consider an Internet-based Master-Worker task computing approach, such as SETI@home. A master process sends tasks, across the Internet, to worker processors. Workers execute, and report back a result. Unfortunately, the disadvantage of this approach is the unreliable nature of the worker processes. Through different studies, workers have been categorized as either malicious (always report an incorrect result), altruistic (always report a correct result), or rational (report whatever result maximizes their benefit). We develop a reputation-based mechanism that guarantees that, eventually, the master will always be receiving the correct task result. We model the behavior of the rational workers through reinforcement learning, and we present three different reputation types to choose, for each computational round, the most reputable from a pool of workers. As workers are not always available, we enhance our reputation scheme to select the most responsive workers. We prove sufficient conditions for eventual correctness under the different reputation types. Our analysis is complemented by simulations exploring various scenarios. Our simulation results expose interesting trade-offs among the different reputation types, workers availability, and cost. © Springer International Publishing AG 2016.en
dc.source4th International Conference on Networked Systems, NETYS 2016en
dc.subjectDistributed computer systemsen
dc.subjectEconomic and social effectsen
dc.subjectReinforcement learningen
dc.subjectPool of workersen
dc.subjectTask computingen
dc.subjectVolunteer computingen
dc.subjectWorker reliabilityen
dc.subjectWorker unresponsivenessen
dc.titleInternet computing: Using reputation to select workers from a poolen
dc.description.volume9944 LNCSen
dc.description.endingpage153 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied SciencesΤμήμα Πληροφορικής / Department of Computer Science
dc.description.notesConference code: 184109</p>en
dc.source.abbreviationLect. Notes Comput. Sci.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