P2P流媒体直播系统自适应邻居节点选择算法

doi:10.3969/j.issn.1001-2400.2012.03.022

J4 ›› 2012, Vol. 39 ›› Issue (3): 136-143.doi: 10.3969/j.issn.1001-2400.2012.03.022

P2P流媒体直播系统自适应邻居节点选择算法

冯侦探^1,2;倪宏²;王劲林²;尤佳莉²

(1. 中国科学院研究生院，北京 100049；
2. 中国科学院声学研究所国家网络新媒体工程技术研究中心，北京 100190)

收稿日期:2011-03-25 出版日期:2012-06-20 发布日期:2012-07-03
作者简介:冯侦探(1983-)，男，中国科学院声学所博士研究生，E-mail: spyfeng@gmail.com．
基金资助:
863计划资助项目课题“融合网络业务体系的开发”(2011AA01A102);

Adaptive neighbor selection method for the P2P media streaming system

FENG Zhentan^1,2;NI Hong²;WANG Jinlin²;YOU Jiali²

(1. Graduate Univ. of Chinese Academy of Sci., Beijing 100049， China;
2. National Network New Media Eng. Research Center, Inst. of Acoustics, Chinese Academy of Sci., Beijing 100190， China)

Received:2011-03-25 Online:2012-06-20 Published:2012-07-03

摘要/Abstract

摘要：

针对P2P网络中节点的异构性，提出了一种基于节点动态服务能力的自适应邻居节点选择算法．首先，为分析节点的动态服务能力特性，对流媒体直播系统进行建模，并根据该模型将系统节点按照服务能力分为不同的级别．再采取随机行走的方式选择邻居节点，随机行走过程结束时的节点被加入备选邻居列表．为保证备选邻居节点拥有较强能力，根据节点服务能力动态调整随机行走的期望静止概率分布，采用Metropolis-Hastings算法计算转移矩阵以满足期望静止概率分布．详细描述了节点加入、退出过程以及邻居节点更新策略，以确保节点负载的均衡及系统稳定性．实验结果表明，该算法能显著提高系统性能，降低系统延时，同时对动态网络环境有良好的鲁棒性．

关键词: 邻居节点选择, 随机行走, 覆盖网, 流媒体直播

Abstract:

Taking into consideration the heterogeneity among peers, an adaptive neighbor selection method is proposed based on peer dynamic capacity. Firstly, in order to analyze the dynamic capacity, a model for the P2P streaming system is presented. According to the model, peers are divided into different levels based on their capacities. Secondly, a random walk process is applied for the purpose of searching the neighbor. The peer is added to the candidate neighbor list when the random walk process ends. In order to guarantee that the candidate neighbors have a high capacity, the expected stationary distribution for the random walk is adjusted according to the peers' dynamic capacity. The transition probability matrix is calculated by the Metropolis-Hastings methods in order to satisfy the expected stationary distribution. Moreover, the neighbors' updated method, and join and departure process are elaborated to ensure the node load balance and system stability. Simulation results demonstrate that the algorithm can significantly improve system performance, reduce system latency, and is very robust in dynamic network environment.

Key words: neighbor peer selection, random walk, overlay, media streaming

中图分类号:

TP393

冯侦探;倪宏;王劲林;尤佳莉. P2P流媒体直播系统自适应邻居节点选择算法[J]. J4, 2012, 39(3): 136-143.

FENG Zhentan;NI Hong;WANG Jinlin;YOU Jiali. Adaptive neighbor selection method for the P2P media streaming system[J]. J4, 2012, 39(3): 136-143.

参考文献

［1］ Zhang Meng, Zhang Qian, Sun Lifeng, et al. Understanding the Power of Pull-Based Streaming Protocol: Can We Do Better?［J］. Selected Areas in Communications, 2007, 25(9): 1678-1694.
［2］卢苇, 关林涛. 一种采用组内分级策略的P2P搜索模型［J］. 西安电子科技大学学报, 2007, 34(3): 486-489.
Lu Wei, Guan Lintao. Search Model of P2P Bases on Tactics of Ranking in Group［J］. Journal of Xidian University, 2007, 34(3): 486-489.
［3］ Ryu M, Ramachandran U. DynaStream: Adaptive Overlay Management for Peer-to-Peer Video Streaming［C］//Proc of the International Conference on Computer Communication Networks. Zurich: IEEE, 2010: 1-6.
［4］ Ghosha J, Wang Miao, Xu Lisong, et al. Variable Neighbor Selection in Live Peer-to-peer Multimedia Streaming Networks［C］//Proc of the Broadband Communications, Networks and Systems. London: IEEE, 2008: 344-346.
［5］ Chan Y W, Lai C H, Chung Y C. A Flexible Locality-aware Peer-to-peer Streaming System［J］. International Journal of Pervasive Computing and Communications, 2010, 6(1): 104-124.
［6］ Zhang Kai, Li Kan. LBA: Location and Bandwidth Awareness Overlay for P2P Live Video Streaming［C］//Proc of Networking and Digital Society. WenZhou: IEEE, 2010: 327-330.
［7］ Abraham A, Liu Hongbo, Hassanien A. Multi Swarms for Neighbor Selection in Peer-to-peer Overlay Networks［J］. Telecommunication Systems, 2011, 46(3): 195-208.
［8］ Chib S, Greenberg E. Understanding the Metropolis-Hastings Algorithm［J］. The American Statistician, 1995, 49(4): 327-335.
［9］ Lov A, Sz L. Random Walks on Graphs: a Survey［J］. Combinatorics: Paul Erdos is Eighty, 1993(2): 1-46.
［10］ Zhong Ming, Shen Kai, Joel S. The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks［J］. IEEE Trans on Comput, 2008, 57(5): 619-633.
［11］ Bernard W, Aleksandrs S, Emin G, et al. Meridian: a Lightweight Network Location Service without Virtual Coordinates［C］//Proc of the 2005 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. Philadelphia: ACM, 2005: 85-96.

[1]	脱立恒;倪宏;李满天;刘学. 覆盖网络中多服务静态部署算法[J]. J4, 2014, 41(4): 137-143.
[2]	徐剑;倪宏;邓浩江;刘磊. 覆盖多播网络中代理服务器的部署算法[J]. J4, 2013, 40(3): 139-144.

P2P流媒体直播系统自适应邻居节点选择算法

Adaptive neighbor selection method for the P2P media streaming system

PDF (PC)

赞

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 2

Metrics

本文评价

推荐阅读 0