Skip to main content
Article thumbnail
Location of Repository

Enhancing Data Locality in a Fully Decentralised P2P Cycle Stealing Framework

By Richard S. Mason and Wayne A. Kelly

Abstract

Peer-to-peer (P2P) networks such as Gnutella and BitTorrent\ud have revolutionised Internet based applications. P2P\ud approaches provide a number of benefits, however most cycle\ud stealing projects, such as SETI@home, have concentrated on\ud centralised methods which still require massive amounts of\ud concentrated network bandwidth in order to scale. More recent\ud P2P research has developed the concept of distributed\ud hash table (DHT) P2P overlays. These overlays provide efficient\ud and guaranteed message delivery unlike earlier P2P\ud networks which relied on large scale replication to probabilistically\ud find data. Our G2:P2P framework makes use of\ud a DHT overlay to provide a fully decentralised P2P cycle\ud stealing system. Its distributed object programming model\ud allows direct communication between objects and it remains\ud reliable even as the set of peer nodes changes.\ud In this paper we describe extensions to G2:P2P which allow\ud us to optimise object distribution for locality. The importance\ud of optimising data locality is well understood and\ud has received extensive research, however, in the context of\ud cycle-stealing systems and more generally DHT based P2P\ud networks it is completely unexplored. Whilst our work is\ud motivated by parallel programming, it is generic in nature\ud and may have applicability to other DHT applications

Topics: 080309 Software Engineering, Peer, to, Peer, Cycle stealing, locality, distributed hash table
Publisher: Australian Computer Society
Year: 2007
OAI identifier: oai:eprints.qut.edu.au:13946

Suggested articles

Citations

  1. (2002). A framework for distributed evolutionary algorithms.
  2. (2000). A scalable content addressable network.
  3. (2003). An enhanced programming model for internet based cycle stealing.
  4. (2004). Boinc: A system for public-resource computing and storage.
  5. (1996). Charlotte: Metacomputing on the web.
  6. (2001). Chord: A scalable peer-to-peer lookup service for internet applications.
  7. (2004). Compup2p: An architecture for sharing of computing resources in peer-to-peer networks with selfish nodes.
  8. (2005). Computing on large-scale distributed systems: Xtrem web architecture, programming models, security, tests and convergence with grid.
  9. (2001). Condor – a distributed job scheduler.
  10. (2005). G2-p2p: A fully decentralised fault-tolerant cycle-stealing framework.
  11. (2002). G2: A grid middleware for cycle donation using .net.
  12. (2003). Incentives build robustness in bittorrent. http://www.bittorrent.com/bittorrentecon.pdf,
  13. (2004). Java remote method invocation -distributed computing for java. http://java.sun.com/products/jdk/rmi/ reference/whitepapers/javarmi.html,
  14. (1997). Knittingfactory: An infrastructure for distributed web applications.
  15. (2001). Microsoft .net remoting: A technical overview. http: //msdn.microsoft.com/library/default.asp?url= /library/en-us/dndotnet/html/hawkremoting.asp,
  16. (2001). Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems.
  17. (2003). Peer-to-peer cycle sharing via .net remoting.
  18. (2001). Peer-to-Peer: Harnessing the Power of Disruptive Technologies, chapter Gnutella. O’Reilly &
  19. (2001). Peer-to-Peer: Harnessing the Power of Disruptive Technologies, chapter Peformance. O’Reilly &
  20. (2003). Pond: the oceanstore prototype.
  21. (2001). SCRIBE: The design of a large-scale event notification infrastructure.
  22. (2004). Tapestry: A resilient global-scale overlay for service deployment.
  23. (2006). Unstructured peer-to-peer networks for sharing processor cycles.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.