Universitat de Lleida
    • English
    • català
    • español
  • English 
    • English
    • català
    • español
  • Login
Repositori Obert UdL
View Item 
  •   Home
  • Recerca
  • Informàtica i Enginyeria Industrial
  • Articles publicats (Informàtica i Enginyeria Industrial)
  • View Item
  •   Home
  • Recerca
  • Informàtica i Enginyeria Industrial
  • Articles publicats (Informàtica i Enginyeria Industrial)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Thumbnail
View/Open
017774.pdf (2.620Mb)
Sol·licita una còpia
Issue date
2012
Author
Rius Torrentó, Josep Maria
Estrada, Soraya
Cores Prado, Fernando
Solsona Tehàs, Francesc
Suggested citation
Rius Torrentó, Josep Maria; Estrada, Soraya; Cores Prado, Fernando; Solsona Tehàs, Francesc; . (2012) . Incentive mechanism for scheduling jobs in a peer-to-peer computing system. Simulation Modelling Practice and Theory, 2012, vol. 25, p. 36-55. https://doi.org/10.1016/j.simpat.2012.02.007.
Impact


Web of Science logo    citations in Web of Science

Scopus logo    citations in Scopus

Google Scholar logo  Google Scholar
Share
Export to Mendeley
Metadata
Show full item record
Abstract
Peer-to-Peer (P2P) computing, the harnessing of idle CPU cycles through the Internet, offers new research challenges in distributed computing. One of the most critical aspects in the design of P2P systems is the development of incentive techniques to encourage cooperation and resource sharing among participants. To tackle this problem, in this paper we propose an incentive and scheduling mechanism based on credits with a two-level topology which is designed to operate on different types of shared computing networks, such as P2P, P2P Grid, Opportunistic Grid, Desktop Grid, volunteer computing platforms, among others. The low level association of peers is made up of one super-peer and its constituent peers. The main contribution at this level is a new reinvestment policy, called ‘‘Weighted’’, that increases peer participation significantly. This mechanism reflects P2P user dynamics, penalizes free-riders efficiently and encourages peer participation. Scalability limitations on the first level are avoided by providing the mechanism with an upper level, made up of super-peers interconnected through an upper level overlay. Our main contribution at this level is the proposal of a task scheduling policy based on three criteria, computing capacity with neighbors, distance and reputation that only use local information for mapping tasks. Simulation results show our proposal performs well and is functional.
URI
http://hdl.handle.net/10459.1/57454
DOI
https://doi.org/10.1016/j.simpat.2012.02.007
Is part of
Simulation Modelling Practice and Theory, 2012, vol. 25, p. 36-55
European research projects
Collections
  • Grup de Recerca en Computació Distribuïda (INSPIRES) [58]
  • Publicacions de projectes de recerca del Plan Nacional [2958]
  • Articles publicats (Informàtica i Enginyeria Industrial) [990]

Contact Us | Send Feedback | Legal Notice
© 2023 BiD. Universitat de Lleida
Metadata subjected to 
 

 

Browse

All of the repositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

Statistics

View Usage Statistics

D'interès

Política institucional d'accés obertDiposita les teves publicacionsDiposita dades de recercaSuport a la recerca

Contact Us | Send Feedback | Legal Notice
© 2023 BiD. Universitat de Lleida
Metadata subjected to