Enforcing Fairness in Asynchronous Collaborative Environments

View Sample PDF

Author(s): Guillaume Pierre (VU University Amsterdam, The Netherlands)and Steen Maarten van (VU University Amsterdam, The Netherlands)
Copyright: 2010
Pages: 14
Source title: Handbook of Research on P2P and Grid Systems for Service-Oriented Computing: Models, Methodologies and Applications
Source Author(s)/Editor(s): Nick Antonopoulos (University of Derby, UK), Georgios Exarchakos (University of Surrey, UK), Maozhen Li (Brunel University, UK)and Antonio Liotta (Technical University of Eindhoven, The Netherlands)
DOI: 10.4018/978-1-61520-686-5.ch036

Keywords: Computer Science & IT / Grid & High Performance Computing / High Performance Computing / Information Science Reference

Purchase

View Enforcing Fairness in Asynchronous Collaborative Environments on the publisher's website for pricing and purchasing information.

Abstract

Many large-scale distributed applications rely on collaboration, where unrelated users or organizations share their resources for everyone’s benefit. However, in such environments any node may attempt to maximize its own benefit by exploiting other’s resources without contributing back. Collaborative systems must therefore deploy strategies to fight free-riders, and enforce collaborative behavior. This chapter explores a family of mechanisms to enforce fairness in asynchronous collaborative environments, where simple tit-for-tat policies cannot be used. Our solutions rely on enforced neighborhood relations, where each node is restricted in the choice of other nodes to collaborate with. This creates long-term collaboration relationships, where each node must behave well with its neighbors if it wants to be able to use their resources.

The IRMA Community

Research IRM

Enforcing Fairness in Asynchronous Collaborative Environments

Purchase

Abstract

Related Content

IRMA Sponsors