Multicast virtual network mapping for supporting multiple description coding-based video applications
Multicast virtual network mapping for supporting multiple description coding-based video applications
复制标题
DOI：
10.1016/j.comnet.2012.11.013
复制
发表时间：
2013-03
期刊：
影响因子：
--
通讯作者：
Yuting Miao;Qiang Yang;Chunming Wu;M. Jiang;Jinzhou Chen
中科院分区：
文献类型：
--
作者：
Yuting Miao;Qiang Yang;Chunming Wu;M. Jiang;Jinzhou Chen
近年来，随着技术的进步，视频应用逐渐成为互联网流量的主流之一。与此同时，网络虚拟化技术允许互联网服务提供商（isp）与物理网络基础设施运营商分离，通过定制的虚拟网络（VNs）向客户提供各种视频服务。在视频组播网络中，ISP可以适当地确定和配置虚拟节点和虚拟链路，为附属的最终用户提供定制的视频服务。然而，可用的多播树映射算法是基于源节点和目标节点集合的位置是先验已知的强烈假设。此外，它们没有将源和目的地之间的任何中间节点纳入VN映射请求。这些假设极大地限制了先进视频编码技术的采用。本文探讨了基于多描述编码（multi - Description Coding， MDC）视频应用的组播网络映射。提出了一种新的基于路径收敛的组播映射算法MMPC，该算法可以灵活地识别和配置组播树中的节点，并具有自动识别中间节点的功能。本文对该方法进行了详细的描述，并通过一组分析证明分析了该方法的主要特点。广泛的仿真实验进行了评估其性能（如接受率，映射成本和映射时间）针对一系列多播VN请求场景。仿真结果表明，以传统的两相VN映射算法为基准，MMPC算法在组播映射效率和成本方面具有优势。
Video applications have gradually become one of the mainstreams of Internet traffic along with the technological advances in recent years. In parallel, network virtualization technique allows Internet Service Providers (ISPs) to be decoupled from the physical network infrastructure operators to provide various video services to customers through tailored Virtual Networks (VNs). In a video multicast VN, the ISP could appropriately determine and configure the virtual nodes and links to deliver customized video service to the affiliated end users. However, available multicast tree mapping algorithms are based on the strong assumption that the locations of source and a collection of destination nodes are known a priori. Also, they have not taken any intermediate nodes between source and destinations into the VN mapping request. These assumptions greatly limit the adoption of advanced video coding techniques. In this paper, the multicast networks mapping for enabling Multiple Description Coding (MDC) based video applications is explored. A novel multicast mapping algorithm, MMPC, is proposed based on path convergence to flexibly identify and configure nodes (with automatic intermediate nodes identification) in multicast trees to meet certain criteria. The suggested approach is described in details and its key characteristics are analyzed through a set of analytical proves. Extensive simulation experiments are carried out to assess its performance (e.g. acceptance ratio, mapping cost and mapping time) against a range of multicast VN request scenarios. The simulation results demonstrate the superiority of MMPC algorithm in terms of multicast mapping efficiency and cost by using the conventional two-phase VN mapping algorithm as a comparison benchmark.