1. 国家核电技术有限公司北京软件中心,北京,100029
2. 中国科学院国家网络新媒体工程技术研究中心,北京,100190
3. 中国科学院声学研究所,北京,100190
网络首发:2011-12-10,
纸质出版:2011
移动端阅览
任浩 1, 3, 王劲林 1, 等. 采用节点优先级的对等网络流媒体请求量分配算法[J]. 西安交通大学学报, 2011,45(12):10-15+38.
Efficient Request Allocation Algorithm for Peer-to-Peer Streaming System[J]. 2011, 45(12): 10-15+38.
在多源协同调度的对等网格(P2P)流媒体系统中
针对现有请求量分配算法不能根据源节点性能动态调整向各节点分配的请求量
导致源节点带宽利用率不高以及服务器负载重的问题
提出一种基于节点优先级的请求量分配算法.该算法根据源节点的历史调度评价和可用数据量计算源节点优先级
调度时根据优先级动态调整分配给各源节点的请求量
优先向历史调度评价好和可用数据量多的源节点分配请求.仿真实验与实际系统测试表明
所提算法可以充分利用源节点带宽资源进行数据传输
较传统算法降低服务器负载17.3%以上
提高了系统可扩展性.
To solve the problem that the existing request allocation algorithm is unable to adjust request amount allocated to each sender according to sender performance in multi-sender based P2P streaming system
leading to an insufficient bandwidth utilization and a heavy server pressure
a peer priority based scheduling algorithm is proposed. The algorithm calculates peer priority based on the historical scheduling evaluation and data ownership. The data request allocated to each peer is adjusted dynamically according to the priority during scheduling
the senders with higher historical scheduling evaluation and more wanted data are preferred to allocate among the data requests. The simulation and experiment in real P2P streaming system show that the proposed algorithm enables to make full use of peer bandwidth resources to transmit media data and reduces server pressure by 17.3% approximately
and the system scalability is improved effectively.
黄泳翔, 钱德沛, 伍卫国, 等. 可分级视频编码覆盖网非一致性随机成员构建算法[J]. 西安交通大学学报,2009, 43(6):1-4.
HUANG Yongxiang, QIAN Depei, WU Weiguo, et al. Non-uniform random membership management to construct overlays for transferring scalable video coding[J]. Journal of Xi'an Jiaotong University, 2009, 43(6):1-4.
PAI V, KUMAR K, TAMILMANI K, et al. Chainsaw:eliminating trees from overlay multicast [M]∥Lecture Notes in Computer Science: 3640. Berlin, Germany: SpringerLink, 2005:127-140.
XU Dongyan, HEFEEDA M, HAMBRUSCH S, et al. On peer-to-peer media streaming[EB/OL].[2011-03-22]. http:∥friends.cs.purdue.edu/pubs/ICDCS02.pdf.
杨薇薇,黄年松. 一种P2P流媒体数据传输任务分派算法[J]. 华中科技大学学报: 自然科学版, 2005, 33(5):3-6.
YANG Weiwei, HUANG Niansong. Data assignment of P2P media streaming[J]. Journal of Huazhong University of Science and Technology, 2005, 33(5):3-6.
LU Yifeng, REN Hao, WANG Jinlin. Real-time performance vs. server bandwidth cost in peer-to-peer streaming system [C]∥Proceedings of the International Conference on Computer and Electrical Engineering. Piscataway, NJ, USA: IEEE, 2008: 286-290.
PALOMAR D, CHIANG M. Alternative distributed algorithms for network utility maximization: framework and applications[J]. IEEE Transactions on Automatic Control,2007, 52(12):2254-2269.
ZHANG Meng, ZHANG Qian, SUN Lifeng, et al. Understanding the power of pull-based streaming protocol: can we do better? [J]. IEEE Journal on Selected Areas in Communications, 2007, 25(9):1678-1694.
Cornell University. Meridian project [EB/OL]. [2011-02-10]. http:∥www.Cs.Cornell.Edu/people/egs/meridian/.
ZHANG Meng, XIONG Yongqiang, ZHANG Qian, et al. Optimizing the throughput of data-driven peer-to-peer streaming [J]. IEEE Transactions on Parallel and Distributed Systems, 2010, 20(1):97-110.
CIULLO D, GARCIA M A, HORVATH A, et al. Network awareness of P2P live streaming applications: a measurement study [J]. IEEE Transactions on Multimedia, 2010, 12(1):54-63.
LI X. NOVA[EB/OL]. [2010-11-30]. http:∥dspnova.8800.org/.
0
浏览量
4
下载量
1
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621