面向对等网络的流媒体接纳控制

doi:10.13190/jbupt.200801.48.059

北京邮电大学学报 ›› 2008, Vol. 31 ›› Issue (1): 48-51.doi: 10.13190/jbupt.200801.48.059

面向对等网络的流媒体接纳控制

杨戈1,2，廖建新1，朱晓民1，王纯1

1．北京邮电大学网络与交换技术国家重点实验室，北京100876; 2. 辽宁大学信息科学与技术学院，沈阳110036

收稿日期:2007-05-25 修回日期:1900-01-01 出版日期:2008-02-28 发布日期:2008-02-28
通讯作者: 杨戈

Peer-to-Peer Oriented Admission Control for Streaming Media

YANG Ge1, 2, LIAO Jian-xin1 , ZHU Xiao-min1, WANG Chun1

1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China;
2. College of Information Science and Technology, Liaoning University, Shenyang 110036, China

Received:2007-05-25 Revised:1900-01-01 Online:2008-02-28 Published:2008-02-28
Contact: YANG Ge

摘要/Abstract

摘要：

提出了基于对等网络的流媒体接纳控制算法，针对不同节点有不同的入口带宽和出口带宽，优先选择贡献率大的请求节点．网络中所有节点的入口带宽都相同时，该算法可取得与distributed DACp2p (differentiated admission contorl) protocol算法相同的系统容量；所有节点的入口带宽不同时，该算法可取得比DACp2p算法更高的系统容量．

关键词: 流媒体, 对等网, 接纳控制

Abstract:

An admission control algorithm based on peer-to-peer for streaming media was proposed. For different peers had different in-bound bandwidth and out-bound bandwidth, the algorithm chooses the requesting the biggest contributed rate peer. When all peers’ in-bound bandwidths are the same, the system capacities that were gained by the algorithm and distributed DACp2p (differentiated admission contorl) protocol algorithm, respectively, would be the same. When all peers’ in-bound bandwidths were not the same, the system capacity that was gained by the algorithm would be bigger than that gained by the DACp2p algorithm.

Key words: streaming media, peer to peer, admission control

中图分类号:

TP311

杨戈1,2，廖建新1，朱晓民1，王纯1. 面向对等网络的流媒体接纳控制[J]. 北京邮电大学学报, 2008, 31(1): 48-51.

YANG Ge1, 2, LIAO Jian-xin1 , ZHU Xiao-min1, WANG Chun1
. Peer-to-Peer Oriented Admission Control for Streaming Media[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2008, 31(1): 48-51.

参考文献

[1] 程久军, 李玉宏, 程时端, 等. 移动P2P系统体系结构与关键技术的研究[J]. 北京邮电大学学报, 2006, 29(4): 86-89. Cheng Jiujun, Li Yuhong, Cheng Shiduan, et al. The architecture on the mobile P2P system and the study for the key technology[J]. Journal of Beijing University of Posts and Telecommunications, 2006, 29(4): 86-89.
[2] 刘亚杰, 窦文华. 一种P2P环境下的VoD流媒体服务体系[J]. 软件学报,2006, 17(4): 876-884. Liu Yajie, Dou Wenhua. A Video-on-demand streaming service architecture in P2P environment[J]. Journal of Software, 2006, 17(4): 876-884.
[3] Chen Ing-Ray, Li Sheng-Tun. A cost-based admission control algorithm for handling mixed workloads in multimedia server systems//Proceedings Eighth International Conference on Parallel and Distributed Systems. Kyongju City: , 2001: 543-548.
[4] Roger Zimmermann, Kun Fu. Comprehensive statistical admission control for streaming media servers//Proceedings of the Eleventh ACM International Conference on Multimedia. : ACM press, 2003: 75-85.
[5] Lai Yuancheng, Lin Yudar. A fair admission control for large-bandwidth multimedia applications[J]. 22nd International Conference on Distributed Computing Systems Workshops, 2002, 6(8): 317-322.
[6] Xu D, Hefeeda M, Hambrusch S, et al. On peer-to-peer media streaming//IEEE Conference on Distributed Computing Systems. : IEEE press, 2002: 363-371.
[7] Chen Gang, Wu Guoxin. A client peer adjustment policy for peer-to-peer media streaming[J]. International Conference on Hybrid Information Technology, 2006, 1(3): 98-102. (上接第47页)
[3] Davey M C, MacKay D J C. Low density parity-check codes over GF(q)[J]. IEEE Comm Lett, 1998, 2(6): 165-167.
[4] Richardson T, Shokrollahi A, Urbanke R. Design of capacity-approaching low-density parity-check codes[J]. IEEE Tran Inform Theory, 2001, 47(2): 619-637.
[5] Song Hongxin, Cruz J R. Reduced-complexity decoding of q-ary LDPC codes for magnetic recording[J]. IEEE Trans Mang, 2003, 39(3): 1081-1087.
[6] Wymerrsch H, Steendam H, Moeneclaey M. Log domain decoding of LDPC codes over GF(q)//Proc IEEE Intern Conf on Common. Paris:, 2004: 772-776.
[7] Declercq D, Fossorier M. Extended minSum algorithm for decoding LDPC codes over GF(q)//Proc ISIT 2005. 2005: 464-468.
[8] Satoshi Gounai, Tomoaki Ohtsuki. Decoding algorithms based on oscillation for low-density parity checks codes[J]. IEICE Transaction on Fundamental, 2005, E88-A8(8): 2216-2226.
[9] Mackay D J C. Encyclopedia of sparse graph codes. 2005. http://www.inference.phy.cam.ac.uk/mackay/codes/data.htm.

[1]	葛志辉, 张旭锋, 宋玲, 李陶深, 李思越. 基于电池电量感知的移动流媒体QoE优化策略[J]. 北京邮电大学学报, 2018, 41(6): 78-82.
[2]	徐全盛, 纪红, 李曦, 廖海帆, 姚丽萍. 高速铁路通信系统中基于优先级的接纳控制机制[J]. 北京邮电大学学报, 2013, 36(6): 41-44.
[3]	张春红, 胡清源, 程时端. 基于降维算法的分布式语义资源搜索[J]. 北京邮电大学学报, 2013, 36(2): 74-78.
[4]	魏祥麟陈鸣张国敏. 一种综合的结构化P2P系统负载均衡机制[J]. 北京邮电大学学报, 2012, 35(3): 87-90.
[5]	聂荣聂林刘超慧雷振明兰巨龙. BitTorrent网络特性的测量与研究[J]. 北京邮电大学学报, 2012, 35(3): 125-128.
[6]	董全李建东赵林靖. 蜂窝系统上行的多业务智能接纳控制方法[J]. 北京邮电大学学报, 2012, 35(2): 32-36.
[7]	吕晓鹏,王文东,龚向阳,马建. 混合网中的P2P资源共享机制[J]. 北京邮电大学学报, 2011, 34(4): 113-117.
[8]	董永强，陶军，杨鹏. 一种价格自适应的链路带宽和缓冲区分配算法[J]. 北京邮电大学学报, 2011, 34(3): 84-88.
[9]	杨莉,张毓森,邢长友,王金双. 兴趣域信任相似度敏感的P2P拓扑构建模型[J]. 北京邮电大学学报, 2011, 34(2): 94-98.
[10]	刘乃文,刘方爱,刘书昌. 环皮特森簇网格的资源搜索机制[J]. 北京邮电大学学报, 2010, 33(4): 59-63.
[11]	陆峰;郑康锋;钮心忻;杨义先. 构建风险敏感的对等网安全信任模型[J]. 北京邮电大学学报, 2010, 33(1): 33-37.
[12]	贡岩1,2,杨放春1,邹华1,双锴1. 利用信任和社会网络的资源发现方法[J]. 北京邮电大学学报, 2009, 32(5): 84-87.
[13]	张代远，江丽敏. 新型P2P流媒体系统模型[J]. 北京邮电大学学报, 2009, 32(4): 68-72.
[14]	代战锋温巧燕李小标. P2P网络环境下的推荐信任模型方案[J]. 北京邮电大学学报, 2009, 32(3): 69-72.
[15]	邹东尧, 宋美娜, 宋俊德. 对等网络Chord模型的分区管理策略[J]. 北京邮电大学学报, 2008, 31(3): 54-58.

面向对等网络的流媒体接纳控制

Peer-to-Peer Oriented Admission Control for Streaming Media

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价