Abstract
This paper proposes an efficient and scalable computational resource discovery overlay orientated towards P2P computing. Our proposal gathers the peers into markets according to their computational resources. Each market is arranged in an N-tree and the trees are linked by a Bruijn graph.
The tree topology allows efficient searching of available resources in a specific market, while Bruijn provides good scalability because search complexity does not depend on the number of markets. A Hilbert function is used to arrange markets in one ordered and mono-dimensional space. This way, the proposed architecture exploits the Bruijn and N-tree topologies together with the Hilbert function. A look-up query mechanism for simple and multiple queries with a low algorithmic cost is also introduced over this architecture. The performance of our proposal was analysed by means of simulation in relation to the widely used Chord overlay with the case of simple queries, and the Baton algorithm with the case of range queries. Furthermore, a large number of experiments demonstrate the proper behaviour of the system. The results obtained reveal the competitiveness 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.
Chapter PDF
Similar content being viewed by others
References
Albrecht, J., Oppenheimer, D., Patterson, D., Vahdat, A.: Design and implementation tradeoffs for wide-area resource discovery. ACM Transactions on Internet Technology (TOIT)Â 8(4) (2008)
Bharambe, A., Agrawal, M., Seshan, S.: Mercury:supporting scalable multiattribute range queries. In: Special Interest Group on Data Communication (SIGCOMM 2004), vol. 34, pp. 353–366 (2004)
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), 1175–1220 (2002)
Cabanillas, D., Willmott, S.: Studying viable free markets in peer-to-peer file exchange applications without altruistic agents. In: Joseph, S., Despotovic, Z., Moro, G., Bergamaschi, S. (eds.) AP2PC 2006. LNCS (LNAI), vol. 4461, pp. 151–158. Springer, Heidelberg (2008)
Castellà , D., Barri, I., Rius, J., Giné, F., Solsona, F., Guirado, F.: Codip2p: A peer-to-peer architecture for sharing computing resources. In: International Symposium on Distributed Computing and Artificial Intelligence, DCAI 2008, vol. 50, pp. 293–303 (2008)
Castellà , D., Blanco, H., Giné, F., Solsona, F.: A computing resource discovery mechanism over a p2p tree topology. In: 9th International Meeting High Performance Computing Science, VECPAR 2010 (2010)
Costa, P., Napper, J., Pierre, G., Steen, M.V.: Autonomous resource selection for decentralized utility computing. In: The 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009), Montreal, Canada (2009)
Foster, I., Iamnitchi, A.: On death, taxes, and the convergence of peer-to-peer and grid computing. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 118–128. Springer, Heidelberg (2003)
Gupta, R., Sekhri, V., Somani, A.K.: Compup2p: An architecture for internet computing using peer-to-peer networks. IEEE Transactions Parallel Distributed Systems 17(11), 1306–1320 (2006)
Jagadish, H.V., Ooi, B.C., Vu, Q.H.: Baton: A balanced tree structure for peer-to-peer networks. In: Very Large Data Base Endowment (VLDB), pp. 661–672 (2005)
Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-theoretic analysis of structured peer-to-peer systems: Routing distances and fault resilience. In: 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 395–406. ACM Press, New York (2003)
Lua, E.K., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Surveys and Tutorials 7, 72–93 (2005)
McNab, R., Howell, F.: Simjava (1998), http://www.dcs.ed.ac.uk/home/hase/simjava/
Meshkova, E., Riihijärvi, J., Petrova, M., Mähönen, P.: A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks. Computer Networks 52(11), 2097–2128 (2008)
Mokbel, M.F., Aref, W.G., Kamel, I.: Analysis of multi-dimensional space-filling curves. Geoinformatica 7(3), 179–209 (2003)
Moon, B., Jagadish, H.V., Faloutsos, C., Saltz, J.H.: Analysis of the clustering properties of the hilbert space-filling curve. IEEE Transactions on Knowledge and Data Engineering 13, 124–141 (2001)
Schmidt, C., Parashar, M.: Squid: Enabling search in dht-based systems. Journal Parallel Distributed Computing 68(7), 962–975 (2008)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of Special Interest Group on Data Communication (SIGCOMM 2001), San Deigo, CA, pp. 149–160 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Castellà , D., Blanco, H., Giné, F., Solsona, F. (2010). Combining Hilbert SFC and Bruijn Graphs for Searching Computing Markets in a P2P System. In: D’Ambra, P., Guarracino, M., Talia, D. (eds) Euro-Par 2010 - Parallel Processing. Euro-Par 2010. Lecture Notes in Computer Science, vol 6271. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15277-1_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-15277-1_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15276-4
Online ISBN: 978-3-642-15277-1
eBook Packages: Computer ScienceComputer Science (R0)