桂林电子科技大学学报2017,Vol.37Issue(4):307-310,4.
基于位置感知的P2P邻居节点选择机制
Research on P2P neighbor node selection algorithm based on location-aware
摘要
Abstract
In order to reduce the utilization ratio of network bandwidth and network throughput,a neighbor node network al-gorithm based on location sensing is proposed.Firstly,the location of each neighbor node and the requesting node is calcu-lated according to the location sensing technology,and the neighboring nodes are divided into regions.Secondly,the param-eters such as the duration,bandwidth and delay of the node are integrated into the service capability of the node.We give preference to neighbor nodes for data interaction,which have the advantages of short distance,big upload bandwidth and good online stability.Finally,the simulation experiment of the node selection algorithm is carried out by using PeerSim. The experimental results show that the algorithm can significantly improve the throughput of P2P on demand system and re-duce the download time of users.The quality of P2P streaming service is improved.关键词
位置感知/节点选择策略/对等网络/服务质量Key words
location-aware/node selection algorithm/peer to peer/quality of service分类
信息技术与安全科学引用本文复制引用
樊瑞,黄桂敏..基于位置感知的P2P邻居节点选择机制[J].桂林电子科技大学学报,2017,37(4):307-310,4.基金项目
国家自然科学基金(61063038) (61063038)