LEVEL HASH TABLE RESOURCE DISCOVERY MECHANISM IN GRID ENVIRONMENT

Liu Weidong, Song Jiaxing, Wang Yue

Abstract

Resource discovery is important in Grid. In this paper, a novel resource discovery mechanism based on level hash table is presented. The Grid resources are hashed into keys, and each LHT Node stores keys that could be mapped into resources registered on LHT Nodes of current sub-tree.We give the detail implementation of it and the simulation results show it works efficiently.

References

  1. Adriana I., 2002. Locating Data in (Small-World?) Peerto-Peer Scientific Collaborations. Lecture Notes in Computer Science, Vol. 2429, p 232 - 241.
  2. Antony R., 2001. Peter Druschel: Pastry Scalable, Decentralized Object Location, and Routing for LargeScale Peer-to-Peer Systems. Lecture Notes in Computer Science, Vol. 2218, p.329
  3. Ben Y., 2001. Tapestry: An Infrastructure for Faulttolerant Wide-area Location and Routing. U. C. Berkeley Technical Report UCB/CSD-01-1141
  4. Buyya R., 2002. A Toolkit for the Modeling and Simulation of Distributed Resource Management and Scheduling for Grid Computing. The Journal of Concurrency and Computation: Practice and Experience (CCPE), Wiley Press
  5. Chapin, 1999. Resource management in Legion. Future Generation Computer Systems, v 15, n 5, p 583-594
  6. Clip2, Gnutella Protocol Specifications v0.4, http://www.clip2.com
  7. Czajkowski, K.2001. Grid information services for distributed resource sharing. High Performance Distributed Computing, 2001. Proceedings. 10th IEEE International Symposium, p 181 - 194
  8. Ian F., 2001. On Fully Decentralized Resource Discovery in Grid Environments. Lecture Notes In Computer Science, Vol. 2242, p 51 - 62
  9. Kaashoek MF., 2003. A Simple Degree-Optimal Distributed Hash Table. Lecture Notes in Computer Science, Vol. 2735/2003, p 98 - 107
  10. Min C., 2004. A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table. Proceedings of the ACM/IEEE SC2004 Conference, p 56
  11. Ratnasamy S., 2001. A scalable content-addressable network. Computer Communication Review, v 31, n 4, p 161-172
  12. Stoica, I., 2001. Chord: A scalable peer-to-peer lookup service for internet applications. Computer Communication Review, v 31, n 4, p 149-160
Download


Paper Citation


in Harvard Style

Weidong L., Jiaxing S. and Yue W. (2006). LEVEL HASH TABLE RESOURCE DISCOVERY MECHANISM IN GRID ENVIRONMENT . In Proceedings of the International Conference on e-Business - Volume 1: ICE-B, (ICETE 2006) ISBN 978-972-8865-62-7, pages 83-87. DOI: 10.5220/0001426800830087


in Bibtex Style

@conference{ice-b06,
author={Liu Weidong and Song Jiaxing and Wang Yue},
title={LEVEL HASH TABLE RESOURCE DISCOVERY MECHANISM IN GRID ENVIRONMENT},
booktitle={Proceedings of the International Conference on e-Business - Volume 1: ICE-B, (ICETE 2006)},
year={2006},
pages={83-87},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001426800830087},
isbn={978-972-8865-62-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on e-Business - Volume 1: ICE-B, (ICETE 2006)
TI - LEVEL HASH TABLE RESOURCE DISCOVERY MECHANISM IN GRID ENVIRONMENT
SN - 978-972-8865-62-7
AU - Weidong L.
AU - Jiaxing S.
AU - Yue W.
PY - 2006
SP - 83
EP - 87
DO - 10.5220/0001426800830087