期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种基于RP(k)的资源感知模型研究

Research on a RP(k)-based resource awareness model
原文传递
导出
摘要 设计了一种以RP(k)为骨干拓扑结构、以Cluster为资源节点簇的文件资源网格RP(k)C-Grid。提出了查询登记机制,以提高簇头节点资源发现能力。以及基于目录广告的资源感知模型,使得查询不用或少量泛洪即可找到所需资源的信息。实验证明RP(k)C-Grid具有良好的可扩展性和资源发现效率。 A file sharing system called RP（ k）C-Grid is designed. It is a hybrid topology overlay network composed of two parts： a RP（k） backbone and resource cluster. A query register mechanism is proposed to enhance the cluster head nodes ability of resource discovery. A resource awareness model based on directory advertisement is introduced to improve resource awareness abihty of the cluster head nodes without flooding. Experimental study reveals that the RP（ k）C-Grid has good efficiency in scalability and resource discovery.
作者 刘乃文 刘方爱
机构地区 山东师范大学信息科学与工程学院
出处 《山东大学学报（理学版）》 CAS CSCD 北大核心 2009年第11期57-62,共6页 Journal of Shandong University(Natural Science)
基金 国家自然科学基金资助项目(90612003)
关键词 网格 资源管理 资源感知 查询登记 对等网络 grid resource management resource awareness query register peer-to-peer network
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献21

  • 1LIU Naiwen, LIU Fangai. Search and replication in a hybrid topology architecture based on RP ( k ) [ C ]// Proceedings of CSSE21308. Washington, DC, USA:[s.n. ], c2008: 925-928.
  • 2LU Q, CAO P, COHEN E, et al. Search and replication in unstructured peer-to-peer networks [ C ]// Proceedings of the 16th ACM Int' l Conf. on Supercomputing. New York: ACM Press, c2002: 84-95.
  • 3KUMAR A, XU J, ZEGURA E W. Efficient and scalable query routing for unstructured peer-to-peer networks[ C]//Proc of IEEE Infocom, Miami, FL, USA: IEEE Press, c2005:13- 17.
  • 4ZHNG Qianbing, LU Xicheng, ZHU Peidong. An efficient random walks based approach to reducing file locating delay in unstructured P2P network[ C ]//IEEE Global Telecommunication Conf., Washington, DC, USA: IEEE Computer Society, c2005 : 213-217.
  • 5LIU Xiaomei, LIU Yunhao, XIAO Li. Improving query response delivery quality in peer-to-peer systems[ J]. IEEE Trans On Parallel and Distributed Systems, 2006, 17 ( 11 ) : 1335- 1347.
  • 6IAN CLARKE, OSKAR SANDBERG, BRANDON WILEY, et al. Freenet: A distributed anonymous information storage and retrieval system[ C]// Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, USA, Washington, DC, USA: IEEE Press, c2000:311-320.
  • 7ION STOICA. Chord: A scalable peer-to-peer lookup protocol for intemet applications[J]. IEEE/ACM Transactions on Networking, 2003, 11 : 17-32.
  • 8RATNASAMY S. A scalable content-addressable network [C]// SIGCOMM Conference. New York: ACM Press, c2001 : 161-172.
  • 9ROWSUON A, DNSCHEL P. Pastry: Scalable, distributed ab- ject location and muting for large-scale peer-to-peer systems [C]// International Conference on Distributed Systems Platforms, Heidelberg, Germany: [s. n. ], c2001:329-358.
  • 10ZHAO B Y, HUANG L, SIKIBLING J, et al. Tapestry: a resilient global-scale overlay for service deployment [J]. IEEE Journal on Selected Areas in Communications, 2004, 22( 1 ): 1-15.

二级参考文献59

  • 1黄宇,金蓓弘,万淑超.P2P系统服务质量研究[J].计算机科学,2005,32(5):45-47. 被引量：7
  • 2Howard Jay Siegel. Interconnection Networks for Large Scale Parallel Processing. New York: McGraw-Hill Publishing Company, 1990
  • 3Yeh Chi-Hsiang, Parhami Behrooz. Routing and embeddings in cyclic Petersen network:An efficient extension of the Petersengraph. In: Proc International Conference on Parallel Processing, Wakamatsu, Japan, 1999. 258-265
  • 4Yeh Chi-Hsiang, Parhami Behrooz. Hierarchical swapped networks: Efficient low-degree alternatives to Hypercube and gen eralized Hypercubes. In: Proc Internatioal Symposium on Parallel Architectures, Algorithms, and Networks, Beijing, 1996. 90 -96
  • 5Liu Fang-Ai, Liu Zhi-Yong, Qiao Xiang-Zhen. A practical interconnection network RP(k) and its routing algorithms. Science in China(Serial F), 2001,44(5): 461-473
  • 6Carl Hamacher V, Hong Jiang. Hierarchical ring network con figuration and performance modeling. IEEE Trans Computer, 2001, 50(1): 1-12
  • 7Lakshmivarahan S, Sudarshan K Dhall. Ring, torus and hyper cube architectures/algorithms for parallel computing. Parallel Computing, 1999,25(13-14): 1877-1906
  • 8Behrooz Parhami, Chi-Hsiang Yeh. Why network diameter is still important. In: Proc International Conference on Communi cations, Las Vegas, USA, 2000. 26-29
  • 9Liu Zhen, Ting-Yi Sung. Routing and transmitting Problems in de Bruijn network. IEEE Trans Computers, 1996, 45(9): 1056 -1062
  • 10Milojicic D S,Kalogeraki V,Lukose R,et al. Peer-to-peer computing [R]. Tech. Rep, HPL-2002-57, HP Laboratories, Palo Alto, Mar. 2002.

共引文献29

山东大学学报（理学版）
2009年 第11期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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