eSciGrid: A P2P-based e-science Grid for scalable and efficient data sharing

Future Generation Computer Systems

Volumn 26, Issue 5, 2010, Pages 704-719

  Sànchez Artigas, Marc ^a   García López, Pedro ^a  

^a UNIVERSITAT ROVIRA I VIRGILI   (Spain)

Author keywords

Data sharing (H.3.5); Distributed databases (H.2.4); Scientific databases (H.2.8)

Indexed keywords

DATA ACCESS; DATA GRID; DATA SETS; DATA SHARING; DECENTRALIZED PROTOCOLS; DISTRIBUTED DATABASE; E-SCIENCE; HIGH QUALITY; LARGE AMOUNTS OF DATA; LOW COSTS; P2P-BASED; PEER TO PEER; SCIENTIFIC DATABASE; SCIENTIFIC RESULTS;

AD HOC NETWORKS; COMPUTER CRIME; DATA TRANSFER; DISTRIBUTED COMPUTER SYSTEMS; QUALITY OF SERVICE;

DATABASE SYSTEMS;

EID: 77950021215     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.future.2009.05.013     Document Type: Article

References (39)

1. W. von Rueden, R. Mondardini, The large hadron collider (lhc) data challenge. http://www.ieeetcsc.org/newsletters/2003-01/mondardini.html
2. Stoica I., et al. Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions Networking 11 1 (2003) 17-32
3. A. Rowstron, P. Druschel, Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems, in: Middleware'01, 2001, pp. 329-350
4. Scholl T., Bauer B., Gufler B., Kuntschke R., Reiser A., and Kemper A. Scalable community-driven data sharing in e-science grids. Future Generation Computer Systems 25 3 (2009) 290-300
5. M. Cai, M. Frank, J. Chen, P. Szekely, Maan: A multi-attribute addressable network for grid information services, in: Proceedings of the 4th International Workshop on Grid Computing (GRID'03), 2003, pp. 184-192
6. Tanin E., and Harwood A. Samet, using a distributed quadtree index in peer-to-peer networks. VLDB Journal 16 (2007) 165-178
7. Trunfio P., Talia D., Papadakis H., Fragopoulou P., Mordacchini M., Pennanen M., Popov K., Vlassov V., and Haridi S. Peer-to-peer resource discovery in grids: Models and systems. Future Generation Computer Systems 23 7 (2007) 864-878
8. P. Ganesan, B. Yang, H. Garcia-Molina, One torus to rule them all: Multi-dimensional queries in p2p systems, in: Proceedings of the 7th International Workshop on the Web and Databases (WebDB '04), 2004, pp. 19-24
9. F. Dabek, R. Cox, F. Kaashoek, R. Morris, Vivaldi: A decentralized network coordinate system, in: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM'04), 2004, pp. 15-26
10. Self-adjusting p2p and grid systems, ref. tin2007-68050-c03. http://www.p2pgrid.info/
11. D. Oppenheimer, J. Albrecht, D. Patterson, A. Vahdat, Distributed resource discovery on planetlab with sword, in: Proceedings of the ACM/USENIX Workshop on Real, on Large Distributed Systems (WORLDS), 2004, pp. 173-180
12. Y. Shu, B.C. Ooi, K.-L. Tan, A. Zhou, Supporting multi-dimensional range queries in peer-to-peer systems, in: Proceedings of the fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05), 2005, pp. 173-180
13. Suna H., Huaia J., Liub Y., and Buyyac R. Rct: A distributed tree for supporting efficient range and multi-attribute queries in grid computing. Future Generation Computer Systems 24 7 (2008) 631-643
14. Schmidt C., and Parashar M. Enabling flexible queries with guarantees in p2p systems. IEEE Internet Computing 8 3 (2004) 19-26
15. M.A.A.R. Bharambe, S. Seshan, Mercury: Supporting scalable multi-attribute range queries, in: Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM'04), 2004, pp. 97-108
16. G. Manku, M. Bawa, P. Raghavan, Symphony: Distributed hashing in a small world, in: Proceedings of the 3rd USENIX Symposium on Internet Technologies and Systems (USITS 2003), 2003
17. Y. Chawathe, S. Ramabhadran, S. Ratnasamy, A. LaMarca, S. Shenker, J. Hellerstein, A case study in building layered dht applications, in: Proceedings of the 2005 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM'05), 2005, pp. 97-108
18. A. Kothari, D. Agrawal, A. Gupta, S. Suri, Range addressable network: A p2p cache architecture for data ranges, in: Proceedings of the third IEEE International Conference on Peer-to-Peer Computing (P2P'03), 2003
19. O.D. Sahin, A. Gupta, D. Agrawal, A.E. Abbadi, A peer-to-peer framework for caching range queries, in: Proceedings of the 20th International Conference on Data Engineering (ICDE'04), 2004, pp. 165-177
20. S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Schenker, A scalable content-addressable network, in: Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM'01), 2001, pp. 161-172
21. T. Pitoura, N. Ntarmos, P. Triantafillou, Replication, load balancing and efficient range query processing in dhts, in: Proceedings of the 9th International Conference on Extending Database Technology (EDBT'06), 2006, pp. 131-148
22. Asiki A., Doka K., Konstantinou I., Zissimos A., Tsoumakos D., Koziris N., and Tsanakas P. A grid middleware for data management exploiting peer-to-peer techniques. Future Generation Computer Systems 25 4 (2009) 426-435
23. P. Ganesan, M. Bawa, H. Garcia-Molina, Online balancing of range-partitioned data with applications to peer-to-peer systems, in: Proceedings of the Thirtieth International Conference on Very Large Data Bases (VLDB'04), 2004, pp. 444-455
24. H. Weatherspoon, J.D. Kubiatowicz, Erasure coding vs replication: A quantitative comparison, in: IPTPS'02: Proceedings of the 1st Intl. Workshop on Peer-to-Peer Systems, 2002
25. I. Mandrichenko, W. Allcock, T. Perelmutov, Gridftp v2 protocol description, gfc document series gfd.47 (2005). http://www.ggf.org/documents/GFD.47.pdf
26. T. Ito, H. Ohsaki, M. Imase, Gridftp-apt: Automatic parallelism tuning mechanism for data transfer protocol gridftp, in: Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06), 2006, pp. 454-461
27. P. Maymounkov, D. Mazieres, Kademlia: A peer-to-peer information system based on the xor metric, in: Proceedings of the first International workshop on Peer-To-Peer Systems (IPTPS'02), 2002
28. K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, I. Stoica, The impact of dht routing geometry on resilience and proximity, in: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM'03), 2003, pp. 381-394
29. V. King, J. Saia, Choosing a random peer, in: Proceedings of the 23th annual ACM symposium on Principles Of Distributed Computing (PODC'04), 2004, pp. 125-130
30. Motwani R., and Raghavan P. Randomized Algortihms (1995), Cambridge University Press
31. Globus, [gridftp manual]. http://www.globus.org/toolkit/docs/4.0/data/gridftp/
32. L. Breslau, P. Cao, L. Fan, G. Phillips, S. Shenker, Web caching and zipf-like distributions: Evidence and implications, 1999, pp. 126-134
33. A. Iamnitchi, M. Ripeanu, I.T. Foster, Locating data in (small-world?) peer-to-peer scientific collaborations, in: Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS'02), 2002, pp. 232-241
34. Calvert K., Doar M., and Zegura E. Modeling internet topology. Communications Magazine, IEEE 35 6 (1997) 160-163
35. Shavitt Y., and Shir E. Dimes: let the internet measure itself. SIGCOMM Computer Communication Review 35 5 (2005) 71-74
36. B. Karp, S. Ratnasamy, S. Rea, S. Shenker, Spurring adoption of dhts with openhash, a public dht service, in: Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS'04), 2004, pp. 195-205
37. T. Ng, H. Zhang, Predicting internet network distance with coordinates-based approaches, 2002, pp. 170-179
38. P. Kalnis, W.S. Ng, B.C. Ooi, D. Papadias, K.-L. Tan, An adaptive peer-to-peer network for distributed caching of olap results, in: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data (SIGMOD'02), 2002, pp. 25-36
39. Damgaard C., and Weiner J. Describing inequality in plant size or fecundity. Ecology 81 4 (2000) 1139-1142