中继协作无线网络中不完美反馈下基于网络编码的重传方案

无线广播网络传输过程中,目的节点反馈信息丢失或部分丢失导致发送节点不能了解目的节点的真实接收状态.为提高不完美反馈下无线网络的重传效率,本文提出中继协作无线网络中不完美反馈下基于网络编码的重传方案.本方案基于部分可观察马尔科夫决策过程对不完美反馈下的重传过程进行建模.发送节点根据系统观测状态和最大置信度更新系统估计状态,根据数据包发送顺序,优先选择最早丢失且能够恢复最多丢包的编码包重传.目的节点缓存不可解编码包以提升编解码机会.重传过程中源节点关注目的节点请求包需求,相同情况优先选择传输可靠性较高的中继节点,以提升传输有效性.仿真结果表明,在不完美反馈下相对于传统方案,本方案可有效提高重传效率.     

无线异构网络中的低复杂度分级视频传输技术

针对无线异构网络中进行视频无线传输遇到的网络拥塞、传输丢失等问题,提出了低编码复杂度分级编解码传输方案,基于逐级优化理论和可分级编码理论,设计了视频分级编码策略:利用小波变换后的不同分解层不同子带构成基本层(Base Layer,BL)和三个增强层,获得了码率分级和质量分级的特性.实验结果证明,随着不同层的更新,视频分级系统的解码质量和整体率失真性能都逐级改善.该传输方案实现了在信道条件动态变化的无线网络环境下仍能流畅传输并接收到有用信息,适用于信道条件不稳定的无线异构网络.     

网络编码在P2P流媒体播放系统的应用

P2P流媒体系统近年来发展非常迅速,显示了巨大的生命力,但是另一方面现有的P2P流媒体系统又存在很多问题：文件定位技术、节点选择技术、网络不稳定性及网络带宽等等。大量的理论研究表明,网络编码可以提高系统的稳定性,提高网络带宽的利用率,而SIP协议可以有效控制和管理P2P网络。文章将网络编码和SIP协议应用到P2P流媒体系统中,目的是解决现有P2P流媒体系统的普遍问题。试验结果表明,应用网络编码技术和SIP协议的P2P流媒体播放系统,在网络健壮性、播放质量、网络资源利用率等方面都有良好的改善。     

无线Adhoc网络中一种基于网络编码的协同MAC协议

协同通信中,中继节点通常用来转发源节点的数据分组.但是从中继节点的角度出发,帮助其它节点转发数据会降低其自身的性能,导致中继低效率问题的出现.针对此问题,该文基于网络编码设计了一种适用于无线Ad hoc网络的协同MAC协议.该协议将网络编码和协同机制相结合,在需要协同传输时,利用网络编码让中继节点在发送源节点数据的同时也发送自身的数据,利用网络编码来解决协同传输中中继低效率问题,进一步提升协同传输的性能.该文还在2维Markov退避模型的基础上,加入了网络编码和协同机制,对所提协议在多跳网络中进行了吞吐量性能分析,并探讨了网络节点数、多跳和信道质量对吞吐量性能的影响.仿真结果表明,相比一般的协同MAC协议,采用网络编码的协同MAC协议可以显著的改善系统性能,是解决协同传输中的中继低效率问题的有效手段.     

基于非正交发送的复数域网络编码协作技术研究

为提升多跳多用户传输系统的频谱效率,本文提出一种基于非正交发送的复数域网络编码协作技术(Complex Field Network Coded Cooperation Based on Non-orthogonal Transmission,CFNCO-NOT)。中继节点对接收数据进行复数域网络编码处理后同时发送,在减小无线信道衰落影响的同时,提高了传输的有效性,并且在目的节点进行简化译码即可实现最佳检测。在两跳的多接入环境中,分析了该技术的频谱效率。结果表明,在高信噪比区域,相对于传统的和基于Alamouti码的数据传输方案,CFNCO-NOT的频谱效率提升了1/3。     

无线Mesh网中基于网络编码的多路径TCP研究

在无线多跳网络中,本地重传和网络编码已经被成功地应用到多路径技术上以增加吞吐量并减少丢包。然而,在提高UDP传输性能的同时,也产生了数据包重排序和延迟等副作用,严重影响了TCP性能。针对此问题,主要提出一种基于网络编码的多路径传输方案NC-MPTCP,即在无线mesh网络的多条路径中引入网络编码、执行拥塞控制以及使用一个基于信用的方法控制节点的传输速率,提高网络的吞吐量以及增加网络传输的可靠性。该方案使用一个简单的算法,评估丢包率以及发送线性组合数据包的速率,用来降低目的节点的数据包解码延迟和防止TCP的超时重传。仿真结果表明设计的NC-MPTCP有效。     

基于随机网络编码的无线广播重传方案及性能分析

针对自动重复重传(ARQ)机制在无线广播系统中吞吐量性能不佳的缺陷,提出一种基于随机网络编码的广播重传方案RNC-ARQ.对于广播节点,采用随机线性码对所有丢失包进行编码组合重传.对于接收节点,当接收的编码包累积到一定数量后可通过解码操作恢复出原始数据.该方案可有效减少重传次数,改善无线广播的吞吐量性能.基于Gilbert-Elliott模型描述的突发错误信道,建立了信道状态和节点接收处理流程合并的多状态马尔可夫模型,并以此为基础推导了RNC-ARQ方案的吞吐量闭合解.最后,使用NS-2模拟器评估RNC-ARQ方案的性能,结果表明在突发差错信道下,基于随机网络编码重传方案的吞吐量优于传统的选择承传ARQ方案和基于异或编码的重传方案.     

基于网络编码的分层媒体多播中的层速率分配优化

该文研究了基于网络编码的分层媒体多播中的层速率优化分配问题。通过优化分配层速率,最大化所有接收节点的接收速率总和。由于该问题是一个非线性整数规划的问题,该文提出了一个时间复杂度为O(|V||T|2|E|2)的启发式的层速率分配算法MRAA。算法MRAA根据各接收节点的接收带宽将网络图按分层层数优化分解成子图,每个子图中各接收节点的最大流的最小值即是相应的层速率。模拟实验表明,算法MRAA相比已有算法对网络吞吐量提高15%18%,对各接收节点的平均带宽利用率改善6%10%。     

图像分层编码技术的分析与设计

无线移动通信信道是时变信道,特性复杂、恶劣,严重影响数字图像信号传输的可靠性。图像分层编码是一种很灵活的编码方式,减轻了因环境变化出现的接收图像质量的剧烈变化,使得图像传输具有良好的鲁棒性和带宽的自适应性,可以有效地解决带宽受限时的图像传输问题。主要介绍了分层编码层数选取、基本层和增强层的码率分配问题,分析了影响这些问题的主要因素,并提出一种基于码率失真理论的增强层码率分配方法。     

一种基于散列邻域搜索网络编码的机会中继重传方法

在无线多播网络中,传统的方法没有考虑某些接收节点与源节点及其他接收节点之间可能具有更好的链路质量.为此提出了一种基于散列邻域搜索网络编码的机会中继重传方法,该方法动态选择数据分组接收情况最好的且信道质量优于源节点的接收节点作为中继,并采用散列邻域搜索网络编码策略进行其他接收节点的丢失分组重传.仿真结果表明,相对于现有的其他网络编码重传方法,该方法能有效减少平均重传次数,提高重传效率,尤其当一些接收节点因受到干扰与源节点之间的信道质量变得很差时,该方法能取得很高的重传增益.     

Delay-constrained transmission of fine scalable coded content over P2P networks

Images or videos are generally coded before transmission, and they can be either non-scalable coded or scalable coded, which can be further classified into fine-scalable coded and coarse-scalable coded. In this paper, we focus on delivery of fine-scalable coded content. The objective of our work is to design algorithms to optimize the quality of fine-scalable coded images or videos on peer-to-peer networks when a requesting peer is delay-sensitive and has to display content within a certain delay bound.Fine-scalable coding has two properties: (1) it embeds lower bit-rate bitstreams into higher bit-rate bitstreams; and (2) its coding quality increases with every additional bit in the coded bitstream. These imply that for a given requesting peer, there may exist a dynamic set of supplying peers that have the same content coded in different bit-rates, have different outgoing bandwidth and may finish transmission at different times.In this paper, we first illustrate the importance of peer assignment problem using an example. Then we formally define and formulate the problem as two integer programming problems, from which we derive an optimal peer assignment solution. Finally, we carry out extensive experiments to verify the excellent performance of the proposed peer assignment algorithms by comparing with other heuristic schemes.     

Slack time–based scheduling scheme for live video streaming in P2P network

Nowadays, peer‐to‐peer network plays a significant role in data transfer and communication. The past few years have witnessed considerable growth in this area because of its inherent advantages. Peer‐to‐peer live streaming has a significant impact on video transmission over the Internet. Major factors that influence the performance of P2P live streaming are overlay construction and scheduling strategies. Although, a large number of scheduling schemes are developed but none of them is comprehensive enough to provide solutions to live streaming issues. These suffer from substantial delay and low video quality at the receiver side. In this paper, a new start‐up–based selection procedure and slack time–based scheduling scheme is proposed. The start‐up selection procedure defines the start‐up buffer location for new peer, and the scheduling scheme selects both the chunk and peers. The proposed scheduling scheme uses both push and pull priority–based strategies. The simulation results of the proposed approach demonstrates significant improvement in both the network performance and video quality at the receiver side. It is observed that playback delay, startup delay, and end‐to‐end delay in the network are reduced and quality of the video at receiver side is improved as the distortion and frame loss ratio is decreased.     

基于网络编码的P2P网络系统研究

以BitTorrent为例,分析了目前流行的P2P系统的工作原理及其存在的问题,介绍了在P2P系统运用网络编码技术来解决这些问题的方法,说明使用网络编码技术可提高文件下载速率,增强系统的鲁棒性,可很好地解决P2P系统中“种子”退出造成的文件下载不完的问题。     

A distributed utility‐based scheduling for peer‐to‐peer video streaming over wireless networks

Interactive multimedia applications such as peer‐to‐peer (P2P) video services over the Internet have gained increasing popularity during the past few years. However, the adopted Internet‐based P2P overlay network architecture hides the underlying network topology, assuming that channel quality is always in perfect condition. Because of the time‐varying nature of wireless channels, this hardly meets the user‐perceived video quality requirement when used in wireless environments. Considering the tightly coupled relationship between P2P overlay networks and the underlying networks, we propose a distributed utility‐based scheduling algorithm on the basis of a quality‐driven cross‐layer design framework to jointly optimize the parameters of different network layers to achieve highly improved video quality for P2P video streaming services in wireless networks. In this paper, the quality‐driven P2P scheduling algorithm is formulated into a distributed utility‐based distortion‐delay optimization problem, where the expected video distortion is minimized under the constraint of a given packet playback deadline to select the optimal combination of system parameters residing in different network layers. Specifically, encoding behaviors, network congestion, Automatic Repeat Request/Query (ARQ), and modulation and coding are jointly considered. Then, we provide the algorithmic solution to the formulated problem. The distributed optimization running on each peer node adopted in the proposed scheduling algorithm greatly reduces the computational intensity. Extensive experimental results also demonstrate 4–14 dB quality enhancement in terms of peak signal‐to‐noise ratio by using the proposed scheduling algorithm. Copyright © 2015 John Wiley & Sons, Ltd.     

CDNPatch: a cost‐effective failover mechanism for hybrid CDN‐P2P live streaming systems

Among the most well‐established live media distribution technologies is content delivery network (CDN), which improves user‐perceived quality of service by delivering content from proxy servers deployed at the Internet's edge. In recent years, CDN providers started to tap into their subscribers' peer‐to‐peer (P2P) capacity to alleviate their server costs. Under the inherent peer dynamics, a major challenge of these hybrid CDN‐P2P systems is to provide efficient failure recovery with good quality of service guarantees at a reduced server cost. In this work we propose a cost‐effective failover solution named CDNPatch to address the aforementioned problem. CDNPatch enables peers to periodically precompute a few backup content suppliers by efficient information exchange and maintenance algorithms, and leverages auxiliary CDN servers and an economic server provisioning algorithm to reduce the chance of playback interruption occurring to peers. Our simulation results show that CDNPatch can mask the impact of peer dynamics of 3 real P2P systems, namely, SOPCast, PPStream, and PPTV, with 100 % failure recovery success rate and a failure recovery time less than 1 second at a cost of small P2P communication overhead of less than 1 kilobits per second, while using only 10%, 21%, and 51%, respectively, of the pure CDN scheme's server consumption.     

Distributed upload bandwidth assigning algorithm in P2P VoD system

In a peer-to-peer(P2P) live streaming system,each peer uses greedy strategy to download chunks as many as possible so as to assure smooth playback and promote the chunk propagation.However,diversity of video playback rate,heterogeneity of peer downlink bandwidth and no prefetching limitation determine that greedy strategy is not the best strategy for P2P video-on-demand(VoD) system though this strategy performs well in P2P live system.To reasonably assign upload bandwidth among peers,we first present a stochastic model to relate expected downloading speed(EDS) with buffered data amount(BDA,the amount of data has been fetched in buffer,however has not been played yet by the peer),video playback rate and fluency(the probability of no interruption in a viewing process).On the base of this model,we design an equal fluency bandwidth assigning algorithm(EFBAA).In this algorithm,requesting peers compute EDS according to several local parameters(such as BDA,video playback rate and fluency) dynamically and independently and send the EDS to neighbor peers together with buffer map.Then the neighbor peer proportionally partitions and assigns its upload bandwidth to requesting peers according to their EDS.Extensive simulations demonstrate that EFBAA outperforms greedy strategy in terms of server load and startup latency.     

P4P技术简介

与传统的两种思路,即P2P应用感知物理网络状况,或者运营商网络限制P2P流量不同,P4P将P2P应用和承载网联合设计,一方面使P2P应用利用网络的能力得到提升,另一方面减少了网络骨干线路上的负载,从而显著地提高ISP的网络效率。本文从P4P的背景、起源、架构、发展前景等方面对P4P进行了介绍。     

Opportunistic Scheduling for Wireless Network Coding

This letter addresses a scheduling problem for wireless network coding (WNC). In our previous work, we have theoretically shown that the optimum number of nodes to be included into a network?coded packet as well as its transmission rate depends on time?varying link condition between a transmitting node and receiving nodes [1]. Based on this observation, this letter designs practical scheme which opportunistically selects scheduled nodes, packets to be coded and an employed modulation level according to time?varying channel conditions and packet length. The numerical results show that the proposed opportunistic scheduling can improve the overall throughput as compared with non?opportunistic approach.