首页> 外文期刊>Information Sciences: An International Journal >Enhancing P2P overlay network architecture for live multimedia streaming
【24h】

Enhancing P2P overlay network architecture for live multimedia streaming

机译:增强P2P覆盖网络体系结构以进行实时多媒体流

获取原文
获取原文并翻译 | 示例
           

摘要

The number of live multimedia streaming applications is increasing, explaining the use of many overlay network topologies. Application-layer multicast (ALM) that it is a feasible alternative to multimedia stream has attracted considerable attention. However, a serious problem of ALM is that the multicast tree may be fragile, and peer failure causes tree partitions. This work presents a novel Hierarchical Ring Tree (HRT) architecture for Peer-to-Peer (P2P) live multimedia streaming. The proposed architecture combines ring-based and tree-based structures in a robust, scalable, reliable and resilient structure that can be used practically as an ALM topology. When peers enter or leave the system, the topology can be recovered rapidly such that live multimedia stream can be delivered smoothly with a low latency. The proposed HRT topology is maintained efficiently without splitting or merging trees. The performance of the proposed architecture and algorithms is evaluated experimentally. Experimental results indicate that the proposed topology can be used in a high-churn P2P network with a small delay. Simulation and experiment results reveal that the proposed architecture has a lower overhead than the ZIGZAG approach when handling peers' joining or leaving, exhibits faster recovery, better quality-of-service during streaming, and a more robust topology, even with an extremely high number of peers joining/leaving.
机译:实时多媒体流应用程序的数量正在增加,这解释了许多覆盖网络拓扑的使用。作为多媒体流的可行替代品的应用层多播(ALM)已引起了广泛的关注。但是,ALM的一个严重问题是多播树可能很脆弱,并且对等故障会导致树分区。这项工作提出了一种新颖的分层环树(HRT)体系结构,用于点对点(P2P)实时多媒体流。所提出的体系结构将基于环的结构和基于树的结构组合成健壮的,可伸缩的,可靠的和有弹性的结构,可以实际用作ALM拓扑。当对等方进入或离开系统时,可以快速恢复拓扑,从而可以低延迟的方式平稳地传递实时多媒体流。所提出的HRT拓扑可以有效地维护,而无需拆分或合并树。实验评估了所提出的体系结构和算法的性能。实验结果表明,所提出的拓扑结构可以在高流量的P2P网络中以较小的延迟使用。仿真和实验结果表明,所提出的体系结构在处理对等体的加入或离开时具有比ZIGZAG方法更低的开销,展现出更快的恢复速度,流期间更好的服务质量以及更健壮的拓扑(即使数量非常多)的同行加入/离开。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号