主动对等计算系统的路由机制  

Routing mechanism in active Peer-to-Peer network

作　　者：李静[1] 刘旭东[1] 林学练[1] 黄子乘[1] 

机构地区：[1]北京航空航天大学计算机学院,北京100083

出　　处：《北京航空航天大学学报》2008年第3期323-326,共4页Journal of Beijing University of Aeronautics and Astronautics

基　　金：自然科学基金重点资助项目(90412011)

摘　　要：针对无结构对等计算系统路由机制中用户需求粒度过细,忽略需求模糊性和多元性的问题,提出了基于用户需求的路由机制.借鉴模糊理论,提出了从文件类型、文件质量、下载速度多方面综合评价节点能力的路由模型.给出了节点能力因素及节点能力的定义,采用隶属度的方式来描述节点提供资源的能力与用户需求的符合程度.分析和实验结果表明,该机制在满足用户需求和减少网络开销方面能够达到很好的均衡.Current routing mechanisms in unstructured Peer-to-Peer system target at locating content combined with too detailed focus on peers＇ need. However, these routing mechanism neglect that the peers＇ requirements are fuzzy and multi-faceted. Therefore, they cannot be well applied to active Peer-to-Peer. In order to solve the problem , a routing mechanism was presented based on peers＇ requirements. A model of routing to evaluate peer capability was proposed in a multitude number of aspects by utilizing fuzzy mathematics. The definition of peer capability factors was given making use of degree of membership to describe the ability for peers to provide resources for users requirement. The analysis and experiment show that the mechanism meets users requirement and reduce cost of network in a good balance.

关 键 词：对等计算 主动对等计算 无结构P2P网络 覆盖网路由 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]