University of Cambridge > > Computer Laboratory Security Seminar > A reciprocation-based economy for multiple services in P2P grids

A reciprocation-based economy for multiple services in P2P grids

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Saar Drimer.

Designers of peer-to-peer grids aim to construct computational grids encompassing thousands of sites. To achieve this scale, the systems cannot rely on trust or off-line negotiations among participants. Moreover, without incentives for donation, there is a danger that free riding will prevail, leading the grid to collapse. Reciprocation-based incentive mechanisms have been proposed to deal with this problem. However, they have only been studied for the case in which a single service – processing power – is shared. In this paper we give a reciprocation-based mechanism for the case when multiple services, such as processing power and data transfers, are shared. In simulations of scenarios in which the services shared are combinations of two different basic services, the mechanism performs very well, even when the cost to peers of donating a service is nearly as large as the utility gained by receiving it.

Mini-bio: Miranda Mowbray is a Technical Contributor at Hewlett-Packard Laboratories, Bristol. She studied political philosophy in the United States before obtaining an MA in Mathematics from Cambridge University and a PhD in Algebra from London University. She co-founded e-mint, the UK Association of Online Community Professionals. Miranda is at present a principal investigator for peer-to-peer technologies at HP Labs.

This talk is part of the Computer Laboratory Security Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity