Integrating trust into grid resource management systems

Azzedin, Farag; Maheswaran, Muthucumaru

doi:10.1109/icpp.2002.1040858

Cited by 113 publications

(68 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They consider a centralized system model, where a central server is assigned responsibility for maintaining reliability ratings that form the basis for assigning tasks to group of voluntary nodes. Such centralized models for scheduling and reputation management [3] present serious bottleneck as regards to scalability of the system and autonomy of Grid sites. Moreover, our approach considers scheduling of workflow applications, whereas the aforementioned approaches are targeted towards bag of tasks type of application model.…”

Section: Dependable Schedulingmentioning

confidence: 99%

Dependable workflow scheduling in global Grids

Rahman

Ranjan

Buyya

2009

2009 10th IEEE/ACM International Conference on Grid Computing

View full text Add to dashboard Cite

In this paper, a reputation-based Grid workflow scheduling algorithm is proposed to counter the effect of inherent unreliability and temporal characteristics of computing resources in large scale, decentralized Grid overlays. The proposed approach builds upon structured peer-to-peer indexing and overlay networking techniques to create a scalable wide-area networking of Grid sites for supporting dependable scheduling of applications. The scheduling algorithm considers reliability of a Grid resource as a statistical property, which is globally computed in the decentralized Grid overlay based on dynamic feedbacks or reputation scores assigned by individual service consumers (Grid Resource Brokers). The proposed algorithm can dynamically adapt to changing resource conditions and offer significant performance gains as compared to traditional approaches in the event of unsuccessful job execution or resource failure. We evaluate and demonstrate the feasibility of our approach through an extensive trace driven simulation. The results show that our scheduling technique can reduce the makespan up to 50% and successfully isolate the failure-prone resources from the system.

show abstract

Section: Dependable Schedulingmentioning

confidence: 99%

Dependable workflow scheduling in global Grids

Rahman

Ranjan

Buyya

2009

2009 10th IEEE/ACM International Conference on Grid Computing

View full text Add to dashboard Cite

show abstract

“…Azzedin and Maheswaran [3,4] interpret reputation as expectation of behavior based on collective information. Their model takes into account trustworthiness of information sources.…”

Section: Related Workmentioning

confidence: 99%

Reputation-based trust management

Shmatikov

Talcott

2005

JCS

View full text Add to dashboard Cite

We propose a formal model for reputation-based trust management. In contrast to credential-based trust management, in our framework an agent's reputation serves as the basis for trust. For example, an access control policy may consider the agent's reputation when deciding whether to offer him a license for accessing a protected resource. The underlying semantic model is an event semantics inspired by the actor model, and assumes that each agent has only partial knowledge of the events that have occurred. Restrictions on agents' behavior are formalized as licenses, with "good" and "bad" behavior interpreted as, respectively, license fulfillment and violation. An agent's reputation comprises four kinds of evidence: completely fulfilled licenses, ongoing licenses without violations or misuses, licenses with violated obligations, and misused licenses. This approach enables precise formal modeling of scenarios involving reputations, such as financial transactions based on credit histories and information sharing between untrusted agents.

show abstract

“…The concept of trust-aware resource management for the Grid was proposed in [14], where a technique is presented for computing trust ratings in a Grid using a weighted combination of past experience and reputation. GridEigenTrust [13] combines this trust-computation technique with the EigenTrust reputation system [12] to provide a mechanism for rating resources in a Grid.…”

Section: Reputation-based Schedulingmentioning

confidence: 99%

Adaptive Reputation-Based Scheduling on Unreliable Distributed Infrastructures

Sonnek

Chandra

Weissman

2007

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

This paper addresses the inherent unreliability and instability of worker nodes in large-scale donationbased distributed infrastructures such as P2P and Grid systems. We present adaptive scheduling techniques that can mitigate this uncertainty and significantly outperform current approaches. In this work, we consider nodes that execute tasks via donated computational resources and may behave erratically or maliciously. We present a model in which reliability is not a binary property but a statistical one based on a node's prior performance and behavior. We use this model to construct several reputationbased scheduling algorithms that employ estimated reliability ratings of worker nodes for efficient task allocation. Our scheduling algorithms are designed to adapt to changing system conditions as well as non-stationary node reliability. Through simulation we demonstrate that our algorithms can significantly improve throughput, while maintaining a very high success rate of task completion. Our results suggest that reputation-based scheduling can handle wide variety of worker populations, including non-stationary behavior, with overhead that scales well with system size. We also show that our adaptation mechanism allows the application designer fine-grain control over desired performance metrics.

show abstract

Integrating trust into grid resource management systems

Abstract: Abstract

Cited by 113 publications

References 13 publications

Dependable workflow scheduling in global Grids

Dependable workflow scheduling in global Grids

Reputation-based trust management

Adaptive Reputation-Based Scheduling on Unreliable Distributed Infrastructures

Contact Info

Product

Resources

About