Abstract
We present an index system for locating files or other data objects in a grid environment. The system is constructed using a distributed hash table, and is scalable, fault-tolerant, and self-organizing. The index is dynamically updated to reflect the state of the storage elements, and can hence deal with nomadic data. The system provides extra services to ease integration with other systems: A registrant service integrates existing storage elements into the system, and a query proxy provides an easy way to query the system. A security model, which builds on the existing grid security model is also provided. An implementation has been created and its performance measured. The system is shown to scale as more nodes are added to the system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ellert, M.: Advanced resource connector middleware for lightweight computational grids. Future Generation Computer Systems (2006), http://www.sciencedirect.com/science/article/B6V06-4KGG1GK-1/2/f023d436acac58c2efba117f6c551c61
Chervenak, A., et al.: Giggle: a framework for constructing scalable replica location services. In: Supercomputing ’02: Proceedings of the 2002 ACM/IEEE conference on Supercomputing, Baltimore, Maryland, pp. 1–17. IEEE Computer Society Press, Los Alamitos (2002)
Cai, M., Chervenak, A., Frank, M.: A peer-to-peer replica location service based on a distributed hash table. In: SC ’04: Proceedings of the 2004 ACM/IEEE conference on Supercomputing, Washington, DC, USA, p. 56. IEEE Computer Society Press, Los Alamitos (2004)
Jin, H., Wang, C., Chen, H.: Boundary chord: A novel peer-to-peer algorithm for replica location mechanism in grid environment. In: ISPAN ’05: Proceedings of the 8th International Symposium on Parallel Architectures, Algorithms and Networks, Washington, DC, USA, pp. 262–267. IEEE Computer Society Press, Los Alamitos (2005)
Jin, H.: ChinaGrid: Making Grid Computing a Reality. In: Chen, Z., et al. (eds.) ICADL 2004. LNCS, vol. 3334, pp. 13–24. Springer, Heidelberg (2004)
Cameron, D., et al.: Replica management in the european datagrid project. Journal of Grid Computing 2(4), 341–351 (2004)
Kubiatowicz, J., et al.: Oceanstore: an architecture for global-scale persistent storage. SIGOPS Oper. Syst. Rev. 34(5), 190–201 (2000), doi:10.1145/384264.379239
Stoica, I., et al.: Chord: A scalable peer-to-peer lookup service for internet applications. In: SIGCOMM ’01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, San Diego, California, United States, pp. 149–160. ACM Press, New York (2001), doi:10.1145/383059.383071
Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley (April 2001)
Ratnasamy, S., et al.: A scalable content-addressable network. In: SIGCOMM ’01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, San Diego, California, United States, pp. 161–172. ACM Press, New York (2001), doi:10.1145/383059.383072
Maymounkov, P., Mazières, D.: Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 53–65. Springer, Heidelberg (2002)
Stutzbach, D., Rejaie, R.: Improving lookup performance over a widely-deployed dht. In: Proceedings of IEEE INFOCOM, Barcelona, Spain (2006)
Douceur, J.R.: The sybil attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 251–260. Springer, Heidelberg (2002)
Housley, R.: A 224-bit one-way hash function: Sha-224 (2004)
Rescorla, E.: Datagram transport layer security (2006)
Winer, D.: Xml-rpc specification (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Jensen, H.T., Kleist, J. (2007). A Peer-to-Peer Indexing Service for Data Grids. In: Cérin, C., Li, KC. (eds) Advances in Grid and Pervasive Computing. GPC 2007. Lecture Notes in Computer Science, vol 4459. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72360-8_43
Download citation
DOI: https://doi.org/10.1007/978-3-540-72360-8_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72359-2
Online ISBN: 978-3-540-72360-8
eBook Packages: Computer ScienceComputer Science (R0)