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

李静; 刘旭东; 林学练; 黄子乘

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

北京航空航天大学计算机学院, 北京 100083

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

详细信息

中图分类号: TP 393
计量
- 文章访问数: 3232
- HTML全文浏览量: 148
- PDF下载量: 2780
- 被引次数: 0
出版历程
- 收稿日期: 2007-06-29
- 网络出版日期: 2008-03-31

Routing mechanism in active Peer-to-Peer network

School of Computer Science and Technology, Beijing University of Aeronautics and Astronautics, Beijing 100083, China

摘要

摘要: 针对无结构对等计算系统路由机制中用户需求粒度过细,忽略需求模糊性和多元性的问题,提出了基于用户需求的路由机制.借鉴模糊理论,提出了从文件类型、文件质量、下载速度多方面综合评价节点能力的路由模型.给出了节点能力因素及节点能力的定义,采用隶属度的方式来描述节点提供资源的能力与用户需求的符合程度.分析和实验结果表明,该机制在满足用户需求和减少网络开销方面能够达到很好的均衡.
- 对等计算 /
- 主动对等计算 /
- 无结构P2P网络 /
- 覆盖网路由
Abstract: 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.
- peer-to-peer /
- active peer-to-peer /
- unstructured P2P /
- routing

HTML全文

参考文献(1)

[1] Lin Xuelian,Huai Jinpeng,Liu Xudong, et al. Active P2P Proceeding of the sixth International Conference on Networking.New York: IEEE Computer Society, 2007:31-43  [2] Ripeanu M.P2P architecture case study: gnutella network .TR-2001-26,2001  [3] Clarke I, Sandberg O, Wiley B ,et al. A distributed anonymous information storage and retrieval system Proceedings of the ICSI Workshop on Design Issues in Anongmity and Unobservability. Berkeley, USA: Springer-Verlag, 2000:46-66  [4] Yang B, Garcia-Molina H. Improving search in peer-to-peer networks Proceedings of the 22nd International Conference on Distributed Computing Systems. Vienna, Austria: IEEE Computer Society, 2002:5-14  [5] Zhuang Z, Liu Y, Xiao L, et al. Hybrid periodical flooding in unstructured peer-to-peer networks Proceedings of the 32nd International Conference on Parallel Processing. Kaohsiung, Taiwan: IEEE Computer Society, 2003:171-178 [6] Zhuge Hai, Li Xiang. P2P in metric space and semantic space[J].Knowledge and Data Engineering, 2007, 19(6),759-771 [7] Song Vuong, Li Juan . Efa: an efficient content routing algorithm in large P2P overlay networks Proceedings of the Third International Conference on P2P Computing. Washington DC, USA: IEEE Computer Society, 2003:216-217 [8] Wang Y, Vassileva J. Bayesian network-based trust model in P2P networks Moro G. Proc,of the 2nd Int-l Workshop on Agents and P2P Computing . Berlin: Springer-Verlag,2004:23-24 [9] 黄克中.随机方法和模糊数学应用[M].上海:同济大学出版社,1987:293-317 Huang Kezhong. The application of stochastic method and fuzzy mathematics[M]. Shanghai: Tongji University Press,1987: 293-317(in Chinese) [10] Chen Hanhua, Jin Hai, Ning Xiaomin, et al. Semrex: a semantic similarity based P2P overlay network[J]. Journal of Software, 2006, 17(5):400-411

施引文献

资源附件(0)

访问统计