北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2010, Vol. 33 ›› Issue (4): 59-63.doi: 10.13190/jbupt.201004.59.liunw

• 论文 • 上一篇    下一篇

环皮特森簇网格的资源搜索机制

刘乃文1,Liu Shu-Chang3,刘方爱2   

  1. 1山东师范大学 信息科学与工程学院 2北京邮电大学 信息与通信工程学院
  • 收稿日期:2009-06-26 修回日期:2010-03-24 出版日期:2010-08-28 发布日期:2010-05-21
  • 通讯作者: 刘乃文 E-mail:sdnwliu@126.com;nwliu@sdnu.edu.cn
  • 基金资助:

    国家级.国家自然科学基金项目

Research on Resource Search Mechanism of Ring Petersen(k) Cluster Grid

  • Received:2009-06-26 Revised:2010-03-24 Online:2010-08-28 Published:2010-05-21

摘要:

设计了一种以环皮特森图(RP(k))结构为骨干拓扑,以簇为资源节点的文件资源系统环皮特森簇网格(RP(k)Cgrid),讨论了RP(k)Cgrid系统的消息路由算法. 提出了簇头探察、簇头泛洪和环皮特森簇(RP(k)C)轮询相结合的probe flooding and scan搜索机制. 对成功跨簇查询的文件在RP(k)C管理节点上建立副本,通过查询登记机制避免簇内泛洪. 实验结果表明,RP(k)Cgrid有效降低了网络负载和查询延迟,具有良好的可扩展性.

关键词: 资源管理, 关口副本, 查询登记, 对等网络, 覆盖网络

Abstract:

Overlay network topology and search algorithms have important influence on resource query efficiency. A file resource grid system called ring petersen (k) cluster grid (RP(k)Cgrid) is designed, it is a hybrid topology overlay network composed of two parts: ring petersen (k) graph (RP(k)) and resource cluster. Message routing algorithms are discussed in detail. Cluster head probe, cluster head flooding and ring petersen (k) cluster (RP(k)C) scan mechanism are executed on RP(k)Cgrid. Replica is created at cluster head node for successful crosscluster query. Query register mechanism efficiently voids flooding within cluster. Experimental result shows that the RP(k)Cgrid has good efficiency in scalability, search delay and load balance.

Key words: resource management, gateway replica, query register, peertopeer, overlay network