首页 | 本学科首页   官方微博 | 高级检索  
     

基于模糊理论的P2P流媒体节点选择算法
引用本文:张娓娓,范训礼,房鼎益.基于模糊理论的P2P流媒体节点选择算法[J].计算机工程,2009,35(23):88-90.
作者姓名:张娓娓  范训礼  房鼎益
作者单位:西北大学信息科学与技术学院,西安,710127
基金项目:中国博士后科学基金资助项目,陕西省教育厅基金资助项目 
摘    要:传统Gossip协议对节点的选择存在盲目性,没有考虑节点的存储能力等影响因素,致使节点选择时网络搜索成功率较低,网络传输负载呈现出随机性。通过对非结构化P2P网络中广泛应用的Gossip协议进行探索和研究,运用模糊理论提出基于可靠性的节点选择策略。通过模拟实验对相关数据进行分析,结果表明该策略能有效提高P2P网络中节点的选择效率。

关 键 词:P2P流媒体  节点选择  Gossip协议
修稿时间: 

Node Selection Algorithm for P2P Streaming Media Based on Fuzzy Theory
ZHANG Wei-wei,FAN Xun-li,FANG Ding-yi.Node Selection Algorithm for P2P Streaming Media Based on Fuzzy Theory[J].Computer Engineering,2009,35(23):88-90.
Authors:ZHANG Wei-wei  FAN Xun-li  FANG Ding-yi
Affiliation:(School of Information Science and Technology, Northwest University, Xi’an 710127)
Abstract:The traditional Gossip protocol selects the neighbor nodes randomly. It does not consider the factors such as node storage, which affects the network performance. It causes the drawback of successful search ratio relatively lower, and network transmission payloads have the characteristics of randomness. By studying the Gossip protocol in P2P networks, a new neighbor node selection strategy is proposed, which is the Most Reliable Gossip(MR-Gossip) message transmission protocol based on fuzzy theory. Simulation experiments with various data analysis demonstrate the improvement of efficiency of the proposed strategy on node selection and correctness of the proposed algorithm in P2P networks.
Keywords:P2P streaming media  node selection  Gossip protocol
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号