期刊文献+

基于结构化对等网的分布式资源发现方法 被引量:1

Distributed Resource Discovery Approach Based on Structured P2P Network
在线阅读 下载PDF
导出
摘要 为了解决大型分布式系统由集中管理导致的扩展性和鲁棒性差的问题,利用改进的结构化对等网组织分布式计算资源,将逻辑空间中的节点分为主机节点和资源节点,分别采取相容性Hash和位置保留Hash与对等网逻辑空间匹配,以满足资源信息的范围查询。 This paper presents a scalable resource discovery approach by modifying structured P2P network to improve scalability and robustness of the distributed system. The peers are classified to node peers and resource peers. Node peers are computing node in distributed system mapped to logic space by the consistent hash. Resource peers are the abstract peers denoting the node attribute information mapped to logic space by the locality preserving hash. This algorithm supports range query of resource peers.
出处 《计算机工程》 CAS CSCD 北大核心 2008年第2期147-150,共4页 Computer Engineering
基金 国家"863"计划基金资助项目"支持大规模分布式网络应用的自主计算环境的研究"(2003AA115230)
关键词 对等网 DHT算法 资源发现 相容性Hash 位置保留Hash P2P network DHT , resource discovery consistent Hash locality preserving Hash
  • 相关文献

参考文献9

  • 1Zhang Xuehai, Freschl J L, Schopf J M. A Performance Study of Monitoring and Information Services for Distributed Systems[C]// Proceedings of HPDC'03. [S. l.]: IEEE Press, 2003-08.
  • 2伯曼,福克斯,海伊.网格计算:支持全球化资源共享与协作的关键技术[M].都志辉,译.武汉:华中科技大学出版社,2005.
  • 3Cai Min. MAAN: A Multi-attribute Addressable Network for Grid Information Services[C]//Proc. of the 4th International Workshop on Grid Computing. Phoenix, Arizona: [s. n.], 2004.
  • 4Cheema A S, Muhammad M. Gupta I. Peer-to-peer Discovery of Computational Resources for Grid Applications[C]//Proc. of Workshop on Grid Computing, [S. l.]: IEEE Press, 2005.
  • 5Oppenheimer D, Albrecht J, Patterson D, et al. Scalable Wide-area Resource Discovery[R]. University of California Berleley, Technical Report: UCB//CSD-04-1334, 2004.
  • 6Meng Yong, Wang Xianbing. A DHT-based Grid Resource Indexing and Discovery Scheme[C]//Proceedings of Singapore-MIT Alliance Symposium. Singapore: [s. n.], 2005.
  • 7Hauswirth A D, John M, Schmidt R, et al. Range Queries in Trie-structured Overlays[C]//Proc. of the 5th IEEE International Conference on Peer-to-peer Computing. Konstanz: [s. n,], 2005.
  • 8Lewin D. Consistent Hashing and Random Trees: Algorithms for Caching in Distributed Networks[D]. [S. l.]: Department of EECS, MIT, 1998.
  • 9Stoica I, Morris R, Karger D, et al. Chord: A Scalable Peer-to-peer Lookup Service for Intemet Applications[C]//Proc. of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. San Diego: [s, n,], 2001.

同被引文献3

  • 1Kamvar S,Schlosser M,Garcia-Molina H.The Eigentrust Algorithm for Reputation Management in P2P Networks[C] //Proc.of ACM International World Wide Web Conference.Budapest,Hungary:ACM Press,2003.
  • 2Faloutsos M,Faloutsos P,Faloutsos C.On Power-law Relationship of the Internet Technology[C] //Proe.of ACM SIGCOMM Conf.on Communications and Computer Networks.Cambridge,USA:ACM Press,1999.
  • 3Cai Min,Frank M,Szekely P.MAAN:A Multi-attribute Addressable Network for Grid Information Services[J].Journal of Grid Computing,2004,2(1):3-14.

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部