Combining Hilbert SFC and Bruijn graphs for searching computing markets in a P2P system

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6271 LNCS, Issue PART 1, 2010, Pages 471-483

  Castellà, Damia ^a   Blanco, Hector ^a   Giné, Francesc ^a   Solsona, Francesc ^a  

^a UNIVERSITY OF LLEIDA   (Spain)

Author keywords

2P computing; P2P overlay; resource discovery

Indexed keywords

2P COMPUTING; BRUIJN GRAPH; COMPUTATIONAL RESOURCES; COMPUTING MARKETS; DIMENSIONAL SPACES; HILBERT; HILBERT FUNCTIONS; MULTIPLE QUERIES; P2P COMPUTING; P2P OVERLAYS; P2P SYSTEM; PROPOSED ARCHITECTURES; QUERY MECHANISMS; RANGE QUERY; RESOURCE DISCOVERY; SEARCH COMPLEXITY; TREE TOPOLOGY;

COMMERCE; COMPETITION; PEER TO PEER NETWORKS; TOPOLOGY; TREES (MATHEMATICS);

TREES (MATHEMATICS); DISTRIBUTED COMPUTER SYSTEMS;

EID: 78349246725     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15277-1_45     Document Type: Conference Paper

References (18)

1. 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)
2. 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)
3. 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)
4. 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)
5. 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)
6. 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)
7. 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)
8. 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) (Pubitemid 37096060)
9. 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) (Pubitemid 44593484)
10. 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)
11. 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)
12. 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)
13. McNab, R., Howell, F.: Simjava (1998), http://www.dcs.ed.ac.uk/home/hase/ simjava/
14. 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)
15. Mokbel, M.F., Aref, W.G., Kamel, I.: Analysis of multi-dimensional space-filling curves. Geoinformatica 7(3), 179-209 (2003)
16. 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) (Pubitemid 32301048)
17. Schmidt, C., Parashar, M.: Squid: Enabling search in dht-based systems. Journal Parallel Distributed Computing 68(7), 962-975 (2008)
18. 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)