Skip to main content

A Computing Resource Discovery Mechanism over a P2P Tree Topology

  • Conference paper
High Performance Computing for Computational Science – VECPAR 2010 (VECPAR 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6449))

Abstract

Peer-to-Peer (P2P) computing, the harnessing of idle compute cycles through Internet, offers new research challenges in the domain of distributed computing. In this paper, we propose an efficient computing resource discovery mechanism based on a balanced multi-way tree structure capable of supporting both exact and range queries, efficiently. Likewise, a rebalancing algorithm is proposed. By means of simulation, we evaluated our proposal in relation to other approaches of the literature. Our results reveal the good performance of our proposals.

This work was supported by the MEyC-Spain under contract TIN2008-05913 and the CUR of DIUE of GENCAT and the European Social Fund.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Foster, I., Iamnitchi, A.: On death, taxes and the convergence of peer-to-peer and grid computing. In: 2nd. Int’l Workshop on P2PSystems (2003)

    Google Scholar 

  2. Gupta, R., Sekhri, V., Somani, A.: CompuP2P: An Architecture for Internet Computing Using Peer-to-Peer Networks. IEEE Transactions on Parallel and Distributed Systems 17(11) (2006)

    Google Scholar 

  3. Kotivalainen, N., Weber, M., Vapa, M., Vuery, J.: Mobile Chedar - A Peer-to-Peer Middleware for Mobile Devices. In: 3rd Int. Conf. on Pervasive Computing and Communications Workshops (PerCom Workshops) (2005)

    Google Scholar 

  4. Castellà, D., Rius, J., Barri, I., Giné, F., Solsona, F.: CoDiP2P: a New P2P Architecture for Distributed Computing. In: Conference on Parallel, Distributed and Network-based Processing (PDP 2009), pp. 323–329 (2009)

    Google Scholar 

  5. Meshkova, E., Riihijrvi, J., Petrova, M., Mhnen, P.: A Survey on Resource Discovery Mechanisms, Peer-to-Peer and Service Discovery Frameworks. Journal of Computer Networks 52, 2097–2128 (2008)

    Article  Google Scholar 

  6. Karger, D., Kaashoek, F., Stoica, I., Morris, R., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: 2001 ACM SIGCOMM Conference, pp. 149–160 (2001)

    Google Scholar 

  7. Jagadish, H., Ooi, B.C., Vu, Q.H.: BATON: A Balanced Tree Strcuture for Peer-to-Peer Networks. In: The 31st Int’l Conference on Very Large Data Bases (VLDB) Conference (2005)

    Google Scholar 

  8. Buyya, R., Murshed, M.: GridSim: A Toolkit for the Modeling and Simulation of Distributed Resource Management and Scheduling for Grid Computing. Concurrency and Computation: Practice and Experience (CCPE) 14(13-15), 1175–1220 (2002)

    Article  MATH  Google Scholar 

  9. SimJava (1998), http://www.dcs.ed.ac.uk/home/hase/simjava/

  10. Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. In: Conference on Applications, Technologies, Architectures, and Protocols For Computer Communications (2003)

    Google Scholar 

  11. Caron, E., Desprez, F., Tedeschi, C.: A Dynamic Prefix Tree for the Service Discovery Within Large Scale Grids. In: The Sixth IEEE International Conference on Peer-to-Peer Computing, P2P 2006 (2006)

    Google Scholar 

  12. Harren, M., Hellerstein, J., Huebsch, R., Loo, B., Shenker, S., Stoica, I.: Complex Queries in DHT-based Peer-to-Peer Networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 242. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Schmidt, C., Parashar, M.: Squid: Enabling Search in DHT-Based Systems. Journal of Parallel and Distributed Computing 68(7), 962–975 (2008)

    Article  MATH  Google Scholar 

  14. Mastroianni, C., Talia, D., Verta, O.: A super-peer model for resource discovery services in large-scale Grids. Future Generation Computer Systems 21, 1235–1248 (2005)

    Article  Google Scholar 

  15. Mastroianni, C., Talia, D., Verta, O.: Designing an information system for Grids: Comparing hierarchical, decentralized P2P and super-peer models. Parallel Computing 34(10), 593–611 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Castellà, D., Blanco, H., Giné, F., Solsona, F. (2011). A Computing Resource Discovery Mechanism over a P2P Tree Topology. In: Palma, J.M.L.M., Daydé, M., Marques, O., Lopes, J.C. (eds) High Performance Computing for Computational Science – VECPAR 2010. VECPAR 2010. Lecture Notes in Computer Science, vol 6449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19328-6_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19328-6_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19327-9

  • Online ISBN: 978-3-642-19328-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics