Fully decentralized DHT based approach to grid service discovery using overlay networks
暂无分享,去创建一个
Qi Xia | Weinong Wang | Ruijun Yang | De Yang
[1] Desh Ranjan,et al. Space Filling Curves and Their Use in the Design of Geometric Data Structures , 1995, LATIN.
[2] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM '01.
[3] Desh Ranjan,et al. Space-Filling Curves and Their Use in the Design of Geometric Data Structures , 1997, Theor. Comput. Sci..
[4] Ian Foster,et al. On Fully Decentralized Resource Discovery in Grid Environments , 2001, GRID.
[5] David R. Karger,et al. INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery , 2002, Pervasive.
[6] Artur Andrzejak,et al. Scalable, efficient range queries for grid information services , 2002, Proceedings. Second International Conference on Peer-to-Peer Computing,.
[7] Manish Parashar,et al. A Peer-to-Peer Approach to Web Service Discovery , 2004, World Wide Web.
[8] Zhichen Xu,et al. PeerSearch: Efficient Information Retrieval in Peer-to-Peer Networks , 2002 .
[9] Philipp Obreiter,et al. Lanes - A Lightweight Overlay for Service Discovery in Mobile Ad Hoc Networks , 2003 .
[10] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.
[11] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.
[12] Steven Tuecke,et al. The Physiology of the Grid An Open Grid Services Architecture for Distributed Systems Integration , 2002 .