摘要
音视频会议等强延迟约束实时多媒体业务是覆盖网组播技术的一个重要应用.随着移动互联网的快速发展,更多的用户期望通过移动终端设备访问这些业务,但现有的覆盖网组播树生成算法不能同时满足终端的异构性和服务延迟约束的需求.为此,提出一种启发式延迟受限覆盖网组播树生成算法.该算法在普通最小延迟组播树的节点中引入了转码能力,同时考虑了移动终端的带宽消耗以及服务延迟等需求,从而能满足链路带宽和节点转码能力约束.仿真实验表明,与Transcasting相比,该算法能够以少量带宽的代价,获得较低的平均服务延迟和较好的组播树健壮性等好处.
Delay-bounded multimedia services, like audio/video conferencing, are important aspects of overlay network multicast. With the development of mobile Internet, more and more users are expecting to access to these services through mobile terminal equipment; however, existing spanning tree algorithm for overlay network multicasting cant satisfy the heterogeneity of mobile termi- nals and service delay constraint concurrently. To this end, this paper puts forward a heuristic delay-bounded overlay multicasting algorithm, which takes both bandwidth demand of mobile terminals and service delay into consideration and as well satisfies the con straint of link bandwidth and transcode capability of serving node. Simulation results show that compared to the Transcasting algorithm proposed by Tamal et al, the proposed algorithm could obviously bring down the average serving delay and enhance the robustness at the cost of slight bandwidth consumption.
出处
《小型微型计算机系统》
CSCD
北大核心
2013年第4期689-693,共5页
Journal of Chinese Computer Systems
基金
国家自然科学基金项目(60802009)资助
"十一五"国家重大专项(2009ZX03003-003
2010ZX03003-001)资助
关键词
覆盖网
组播
生成树
延迟约束
overlay network
multicasting
spanning tree
delay-bounded
