Incentive mechanism for scheduling jobs in a peer-to-peer computing system

Rius, Josep; Estrada, Soraya; Cores, Fernando; Solsona, Francesc

doi:10.1016/j.simpat.2012.02.007

Cited by 6 publications

(7 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The publications [34,66,138,142,145] proposed a general auction incentive not restricted to a specific task. The reviewed work on P2P computing [29,70,102] and service discovery mechanisms [24,25] exclusively used Double auctions. Wei et al addressed the crowdsensing task with reverse English auctions, in which the lowest bidder receives a task [123].…”

Section: Auctionmentioning

confidence: 99%

“…Reviewed works predominantly applied reputation-based incentives for file sharing [5,11,42,43,58,62,63,75,77,84,92,109,117,127] and media streaming [6,11,30,36,42,52,65,72,79,87,93,101,117,118,132,136]. Only two articles covered peerto-peer computing [76,97,102], and service discovery [24,98], respectively. Other applications included joint radio resource allocation [47,49], the prevention of fake online media [20], and federated machine learning [55].…”

Section: Reputationmentioning

confidence: 99%

“…Some reputation mechanisms group participants based on their reputation into clusters, also referred to as coalitions or groups, rather than defining the service quality for individual participants [5,11,39,43,47,65,76,77,109]. Super peers that manage peer groups are a semi-centralized approach of grouped reciprocity-based incentives [63,102,115,127]. Peers are assigned to super peers based on their reputation value, physical proximity, thematic similarity, common interest, or at random.…”

Section: Reputationmentioning

confidence: 99%

See 2 more Smart Citations

Incentive Mechanisms in Peer-to-Peer Networks — A Systematic Literature Review

et al. 2023

View full text Add to dashboard Cite

Centralized networks inevitably exhibit single points of failure that malicious actors regularly target. Decentralized networks are more resilient if numerous participants contribute to the network’s functionality. Most decentralized networks employ incentive mechanisms to coordinate the participation and cooperation of peers and thereby ensure the functionality and security of the network. This article systematically reviews incentive mechanisms for decentralized networks and networked systems by covering 165 prior literature reviews and 178 primary research papers published between 1993 and October 2022. Of the considered sources, we analyze eleven literature reviews and 105 primary research papers in detail by categorizing and comparing the distinctive properties of the presented incentive mechanisms. The reviewed incentive mechanisms establish fairness and reward participation and cooperative behavior. We review work that substitutes central authority through independent and subjective mechanisms run in isolation at each participating peer and work that applies multiparty computation. We use monetary, reputation, and service rewards as categories to differentiate the implementations and evaluate each incentive mechanism’s data management, attack resistance, and contribution model. Further, we highlight research gaps and deficiencies in reproducibility and comparability. Finally, we summarize our assessments and provide recommendations to apply incentive mechanisms to decentralized networks that share computational resources.

show abstract

Section: Auctionmentioning

confidence: 99%

Section: Reputationmentioning

confidence: 99%

Section: Reputationmentioning

confidence: 99%

See 1 more Smart Citation

Incentive Mechanisms in Peer-to-Peer Networks — A Systematic Literature Review

et al. 2023

View full text Add to dashboard Cite

show abstract

“…The tasks travel from the root to the leaves, using decisions taken in each step. The decision could be based on probabilistic models [Kwan and Jogesh 2010] or other factors, such as reputation [Rius et al 2012].…”

Section: Related Workmentioning

confidence: 99%

A volunteer computing system implemented with peer-to-peer communication optimized for small and limited environments

Santiago¹,

Digiampietri²

2018

Anais Do Brazilian E-Science Workshop (BreSci)

View full text Add to dashboard Cite

The computational needs of scientific experiments often require powerful computers. One alternative way to obtain this processing power is taking advantage of the idle processing of personal computers as volunteers. This technique is known as volunteer computing and has great potential in helping scientists. However, there are several issues which can reduce the efficiency of this approach when applied to complex scientific experiments, such as, the ones with long processing time, very large input or output data, etc. In order to face these challenges, we designed a volunteer computing system based on peer-to-peer communication. When compared with the local execution of activities and traditional volunteer computing, the execution time was improved and, in some cases, there was also a reduction of the server upload bandwidth use. Scientific experiments, in several cases, are organized as bag-of-tasks [Kwan and Jogesh 2010] or scientific workflows [Medeiros et al. 1996]. Bag-of-tasks are composed of a set of completely independent tasks, what is very different from workflows where a task needs to wait for the conclusion of another task. Both, typically, require huge computational power and a way to obtain it is the use of several personal computers, for example, desktop grids [Kondo et al. 2007, Anderson 2004] or volunteer computing [Anderson and Fedak 2006]. Volunteer computing (VC) projects take idle resources from donors: the tasks are sent to volunteers (in general using the Internet), and they send the results back to a server. This approach may provide a lot of computational power [Anderson 2004], but in scientific experiments, there are many issues which can turn this approach inefficient, such as long processing tasks [Dethier et al. 2008], great volumes of data to be transferred [Duan et al. 2012] or instability in volunteer computers [Dias et al. 2010]. The majority of these issues are related to the low-speed communication with donors across the Internet. The development of this work was based on an extension [Digiampietri et al. 2014b] of the Workflow Management System (WfMS) called WOODSS (A Spatial Decision Support System based on Workflows) [Seffino et al. 1999], an open source system written in Java extended in this project to deal with P2P communication.

show abstract

“…In this regard, pricing has shown to be effective in encouraging sharing of computing devices, and several solutions have been proposed, such as Flat Rate [57], Auction-based [58], Stock-Market and Micropayment approaches [59]. The integration of distributed credit-based schemes with the task scheduling policy has also recently been investigated [60]. Positive indications on the usefulness of monetary incentives have been provided in [61].…”

Section: A Incentive Modelmentioning

confidence: 99%

Volunteer Computing on Mobile Devices

Tapparello

Funai

Hijazi

et al. 2016

Mobile Computing and Wireless Networks

View full text Add to dashboard Cite

Different forms of parallel computing have been proposed to address the high computational requirements of many applications. Building on advances in parallel computing, volunteer computing has been shown to be an efficient way to exploit the computational resources of under utilized devices that are available around the world. The idea of including mobile devices, such as smartphones and tablets, in existing volunteer computing systems has recently been investigated. In this chapter, we present the current state of the art in the mobile volunteer computing research field, where personal mobile devices are the elements that perform the computation. Starting from the motivations and challenges behind the adoption of personal mobile devices as computational resources, we then provide a literature review of the different architectures that have been proposed to support parallel computing on mobile devices. Finally, we present some open issues that need to be investigated in order to extend user participation and improve the overall system performance for mobile volunteer computing.

show abstract

Incentive mechanism for scheduling jobs in a peer-to-peer computing system

Cited by 6 publications

References 28 publications

Incentive Mechanisms in Peer-to-Peer Networks — A Systematic Literature Review

Incentive Mechanisms in Peer-to-Peer Networks — A Systematic Literature Review

A volunteer computing system implemented with peer-to-peer communication optimized for small and limited environments

Volunteer Computing on Mobile Devices

Contact Info

Product

Resources

About