Optimal Spot-checking for Computation Time Minimization in Volunteer Computing

Watanabe, Kouichi; Fukushi, Masaru; Horiguchi, Susumu

doi:10.1007/s10723-009-9125-4

Cited by 14 publications

(7 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As q increases, each saboteur gets spotter jobs more frequently; thus, the master can detect saboteurs and decrease the error-rate easily by backtracking [23], [24]. On the other hand, it also increases the computation time due to the increased number of spotter jobs as shown in Figure 5 (b).…”

Section: ) For Threshold Rmentioning

confidence: 99%

Collusion-Resistant Sabotage-Tolerance Mechanisms for Volunteer Computing Systems

Watanabe

Fukushi

Horiguchi

2009

2009 IEEE International Conference on E-Business Engineering

Self Cite

View full text Add to dashboard Cite

This paper presents a proposal of a collusionresistant sabotage-tolerance mechanism against malicious sabotage attempts in volunteer computing (VC) systems. While VC systems reach the most powerful computing platforms, they are vulnerable to mischief because volunteers can output erroneous results, for various reasons ranging from hardware failure to intentional sabotage. To protect the integrity of data and validate the computation results, most VC systems rely on the replication-based sabotage-tolerance mechanisms such as the m-first voting. However, these mechanisms are powerless against malicious volunteers (saboteurs) that have intention and use some form of collusion. To face this collusion threat, this paper proposes a spot-checking-based mechanism, which estimates the frequency of malicious attempts and dynamically eliminates erroneous results from the system. Simulation of VCs shows that the proposed method can improve the performance of VC systems up to 30 percent, while guaranteeing the same level of computational correctness.

show abstract

Section: ) For Threshold Rmentioning

confidence: 99%

Collusion-Resistant Sabotage-Tolerance Mechanisms for Volunteer Computing Systems

Watanabe

Fukushi

Horiguchi

2009

2009 IEEE International Conference on E-Business Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…In spot-checking [8], a master sometimes assigns spotter jobs whose correct results are already known to the master. With this technique, the master can directly check if workers behave maliciously or not.…”

Section: Spot-checkingmentioning

confidence: 99%

Optimized Replication Management with Reputation for Detecting Collusion in Large Scale Cloud Systems

Bennasar¹,

Essaaidi²,

Bendahmane³

et al. 2019

IJCA

View full text Add to dashboard Cite

Several cloud computing systems used voting techniques to deal with sabotage issues. However, these techniques become inefficient, and present some new security vulnerabilities when malicious resources collude and return the same wrong result. Usually, this kind of security threats are handled using several techniques and approaches such as voting techniques. In this paper, a very efficient approach to overcome sabotage issues is proposed, especially in the case of very complex attacks. The performances of this approach are evaluated in a cloud system model and it is compared against other voting techniques, like reputation-based voting, using simulations which allowed to investigate the effect of collusive cloud resources on the correctness of the results. The obtained results show that the proposed approach achieves lower error rates and enhanced performances in terms of overhead and slowdown. General TermsCyber-security.

show abstract

“…Scheduling mechanism that performs most of below mentioned points is taken as better mechanism. Though none of these factors are considered collectively in the literature but few of them can be found in [2,3,5,6,7,14,15,22,25,26].…”

Section: A Key Performance Factorsmentioning

confidence: 99%

Scheduling in Desktop Grid Systems: Theoretical Evaluation of Policies & Frameworks

Khan¹,

Mahmood²,

Hyder³

2017

ijacsa

View full text Add to dashboard Cite

Abstract-Desktop grid systems have already established their identity in the area of distributed systems. They are well suited for High Throughput Computing especially for Bag-ofTasks applications. In desktop grid systems, idle processing cycles and memory of millions of users (connected through internet or through any other communication mechanism) can be utilized but the workers / hosts machines not under any centralized administrative control that result in high volatility. This issue is countered by applying various types of scheduling policies that not only ensure task assignments to better workers but also takes care of fault tolerance through replication and other mechanism. In this paper, we discussed leading desktop grid systems framework and performed a comparative analysis of these frameworks. We also presented a theoretical evaluation of server and client based scheduling policies and identified key performance indicators to evaluate these policies.

show abstract

Optimal Spot-checking for Computation Time Minimization in Volunteer Computing

Cited by 14 publications

References 16 publications

Collusion-Resistant Sabotage-Tolerance Mechanisms for Volunteer Computing Systems

Collusion-Resistant Sabotage-Tolerance Mechanisms for Volunteer Computing Systems

Optimized Replication Management with Reputation for Detecting Collusion in Large Scale Cloud Systems

Scheduling in Desktop Grid Systems: Theoretical Evaluation of Policies & Frameworks

Contact Info

Product

Resources

About