Skip to main content
SpringerLink
Log in

A peer-to-peer system for on-demand sharing of capacity across network applications

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

As a plethora of various distributed applications emerge, new computing platforms are necessary to support their extra and sometimes evolving requirements. This research derives its motive from deficiencies of real networked applications deployed on platforms unable to fully support their characteristics and proposes a network architecture to address that issue. Hoverlay is a system that enables logical movement of nodes from one network to another aiming to relieve requesting nodes, which experience high workload. Node migration and dynamic server overlay differentiate Hoverlay from Condor-based architectures, which exhibit more static links between managers and nodes. In this paper, we present a number of important extensions to the basic Hoverlay architecture, which collectively enhance the degree of control owners have over their nodes and the overall level of cooperation among servers. Furthermore, we carried out extensive simulations, which proved that Hoverlay outperforms Condor and Flock of Condors in both success rate and average successful query path length at a negligible increase in messages.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Bedrax-Weiss T, Macgann C, Ramaksishnan S (2003) Formalizing resources for planning, PDDL03: Proceedings of the Workshop on Planning Domain Description Language, Trento, Italy, pp 7–14, June

  2. Exarchakos G, Antonopoulos N (2007) Resource sharing architecture for cooperative heterogeneous P2P overlays. J Netw Syst Manag 15:311–334

    Article  Google Scholar 

  3. Cohen E, Shenker S (2002) Replication strategies in unstructured peer-to-peer networks. ACM SIGCOMM Comput Comm Rev 32(4):177–190

    Article  Google Scholar 

  4. Tsoumakos D, Roussopoulos N (2006) Analysis and comparison of P2P search methods, ACM 1st International Conference on Scalable Information Systems, Hong Kong, China, vol. 152, no. 25, May

  5. Yang X, de Veciana G (2006) Performance of peer-to-peer networks: service capacity and role of resource sharing policies. Perform Eval 63(3):175–194

    Article  Google Scholar 

  6. Zhou D, Lo V (2004) Cluster computing on the fly: resource discovery in a cycle sharing peer-to-peer system, CCGrid: IEEE International Symposium on Cluster Computing and the Grid, Chicago, Illinois USA, pp 66–73, April

  7. Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content addressable network, conference on applications, technologies, architectures, and protocols for computer communications, San Diego, California, United States, pp 161–172, August

  8. Stoica I, Morris R, Liben-Nowell D, Karger DR, Kaashoek MF, Dabek F, Balakrishnan H (2003) Chord: a scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Trans Netw 11(1):17–32

    Article  Google Scholar 

  9. Rowstron A, Druschel P (2001) Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lect Notes Comput Sci 2218

  10. Zhao BY, Kubiatowicz JD, Joseph AD (2001) Tapestry: an infrastructure for fault-tolerant wide-area location and routing. University of California at Berkeley, Berkeley

    Google Scholar 

  11. Lua K, Crowcroft J, Pias M, Sharma R, Lim S (2005) A survey and comparison of peer-to-peer overlay network schemes. Commun Surv Tutor IEEE: 72–93

  12. Litzkow MJ, Livny M, Mutka MW (1988) Condor-a hunter of idle workstations, 8th International Conference on Distributed Computing Systems, pp 104–111

  13. Thain D, Tannenbaum T, Livny M (2005) Distributed computing in practice: the condor experience. Concurrency Comput Pract Ex 17(2–4):323–356

    Article  Google Scholar 

  14. Evers X, de Jongh JFCM, Boontje R, Epema DHJ, van Dantzig R (1993) Condor flocking: load sharing between pools of workstations, technical report DUT-TWI-93-104. Delft University of Technology, The Netherlands

    Google Scholar 

  15. Epema DHJ, Livny M, van Dantzig R, Evers X, Pruyne J (1996) A worldwide flock of Condors: load sharing among workstation clusters. J Future Generat Comput Syst 12(1):53–65

    Article  Google Scholar 

  16. Butt A, Zhang R, Hu C (2006) A self-organizing flock of Condors. J Parallel Distr Comput 66(1):145–161

    MATH  Google Scholar 

  17. Androutsellis-Theotokis S, Spinellis D (2004) A survey of peer-to-peer content distribution technologies. ACM Comput Surv (CSUR) 36(4):335–371

    Article  Google Scholar 

  18. Philippe K (2001) P-Grid: a self-organizing structured P2P system, Sixth International Conference on Cooperative Information Systems (CoopIS 2001). Lect Notes Comput Sci 2172:179–194

    Article  Google Scholar 

  19. Caviglione L, Davoli F (2005) Peer-to-peer middleware for bandwidth allocation in sensor networks. IEEE Comm Lett 9(3):285–287

    Article  Google Scholar 

  20. Raman R, Livny M, Solomon M (1999) Matchmaking: an extensible framework for distributed resource management. Clust Comput 2(2):129–138

    Article  Google Scholar 

  21. Gupta R, Sekhri V, Somani AK (2006) CompuP2P: an architecture for internet computing using peer-to-peer networks. IEEE Trans Parallel Distr Syst 17(11):1306–1320

    Article  Google Scholar 

  22. Karbhari P, Ammar M, Dhamdhere A, Raj H, Riley GF, Zegura E (2004) Bootstrapping in Gnutella: a measurement study, volume 3015/2004 of Lecture Notes in Computer Science. Springer Berlin, Heidelberg, pp 22–32

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Surrey, Surrey GU2 7XH, Guildford, UK

    Georgios Exarchakos & Nick Antonopoulos

  2. Electrical Engineering, Eindhoven University of Technology, Eindhoven, 5612 AZ, The Netherlands

    Georgios Exarchakos

Authors
  1. Georgios Exarchakos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nick Antonopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Georgios Exarchakos.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Exarchakos, G., Antonopoulos, N. A peer-to-peer system for on-demand sharing of capacity across network applications. Peer-to-Peer Netw. Appl. 5, 58–73 (2012). https://doi.org/10.1007/s12083-011-0108-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-011-0108-4

Keywords

Search

Navigation