H-CRAN网络下联合拥塞控制和资源分配的网络切片动态资源调度策略

针对异构云无线接入网络(H-CRAN)网络下基于网络切片的在线无线资源动态优化问题,该文通过综合考虑业务接入控制、拥塞控制、资源分配和复用,建立一个以最大化网络平均和吞吐量为目标,受限于基站(BS)发射功率、系统稳定性、不同切片的服务质量(QoS)需求和资源分配等约束的随机优化模型,并进而提出了一种联合拥塞控制和资源分配的网络切片动态资源调度算法。该算法会在每个资源调度时隙内动态地为性能需求各异的网络切片中的用户分配资源。仿真结果表明,该文算法能在满足各切片用户QoS需求和维持网络稳定的基础上,提升网络整体吞吐量,并且还可通过调整控制参量的取值实现时延和吞吐量间的动态平衡。     

Adaptive packet scheduling for scalable video streaming with network coding

Over the last decade, the emergence of new multimedia devices has motivated the research on efficient media streaming mechanisms that adapt to dynamic network conditions and heterogeneous devices’ capabilities. Network coding as a rateless code has been applied to collaborative media streaming applications and brings substantial improvements regarding throughput and delay. However, little attention has been given to the recoverability of encoded data, especially for the streaming with a strict deadline. This in turn leads to severe quality of experience. In this paper, we solve the unrecoverable transmission by proposing a multi-generation packet scheduling problem, which is treated as a video quality maximization problem and solved using dynamic programming algorithm. Experimental results confirm that the proposed algorithm brings better data recoverability and better quality of service in terms of video quality, delivery ratio, lower redundancy rate under different network sizes.     

基于动态流感知的接纳控制策略研究

流感知接纳控制使用调度机制测量的优先队列队长和公平速率作为链路状态信息实现隐式接纳判决。在对动态流感知进行分析的基础上,定义了优先队列的拥塞指数。在不同拥塞指数条件下,提出分别使用与流峰值速率相关的接纳概率对多业务进行区分接入判决,通过拒绝高速弹性流的接入达到对低速实时流的性能保护。推导了实时流阻塞率和弹性流平均吞吐量的理论公式。仿真结果显示相对于基于测量的接纳控制算法,提出策略具有较低的阻塞率和更好的平均吞吐量性能。     

Video distribution techniques over WiMAX networks for m-Health applications

In this paper, we propose a novel approach for video distribution over IEEE 802.16 networks for mobile Healthcare (m-Health) applications. The technique incorporates resource distribution, scheduling, and content-aware video streaming taking advantage of a flexible quality of service functionality offered by IEEE 802.16/WiMAX technology. The proposed technique is thoroughly investigated using network simulator software under various real-life m-Health scenarios, which include streaming video over medium access control layer service connections. It is shown that the technique is fully compatible with the WiMAX standard specification and allows a 9-16% increase in the overall network throughput, which is dependent upon the initial system configuration and the selection of WiMAX user parameters.     

Design and Implementation of a Network‐Adaptive Mechanism for HTTP Video Streaming

This paper proposes a network‐adaptive mechanism for HTTP‐based video streaming over wireless/mobile networks. To provide adaptive video streaming over wireless/mobile networks, the proposed mechanism consists of a throughput estimation scheme in the time‐variant wireless network environment and a video rate selection algorithm used to increase the streaming quality. The adaptive video streaming system with proposed modules is implemented using an open source multimedia framework and is validated over emulated wireless/mobile networks. The emulator helps to model and emulate network conditions based on data collected from actual experiments. The experiment results show that the proposed mechanism provides higher video quality than the existing system provides and a rate of video streaming almost void of freezing.     

A novel adaptive logic for dynamic adaptive streaming over HTTP

In this paper, we propose an estimation method that estimates the throughput of upcoming video segments based on variations in the network throughput observed during the download of previous video segments. Then, we propose a rate-adaptive algorithm for Hypertext Transfer Protocol (HTTP) streaming. The proposed algorithm selects the quality of the video based on the estimated throughput and playback buffer occupancy. The proposed method selects high-quality video segments, while minimizing video quality changes and the risk of playback interruption, improving user’s experience. We evaluate the algorithm for single- and multi-user environments and demonstrate that it performs remarkably well under varying network conditions. Furthermore, we determine that it efficiently utilizes network resources to achieve a high video rate; competing HTTP clients achieve equitable video rates. We also confirm that variations in the playback buffer size and segment duration do not affect the performance of the proposed algorithm.     

基于模糊流感知的动态优先公平调度算法

为适应网络的动态性,提高调度公平性和资源效率,流感知优先公平调度机制需要动态的多业务区分转发。与链路负载状态相关的模糊流感知能够实现路径上的一致性业务区分,而基于模糊流感知的动态优先公平调度算法通过调整优先队列负载门限在流式流和弹性流之间实现转发优先权的动态交替,在链路轻载时实现不同流间的相对公平调度,在链路重载时则强调实时业务的绝对优先权以保证其时延要求。算法公平性分析和仿真计算显示提出算法的动态区分转发通过适度增加优先业务队长能够大幅度提高弹性流的接纳率,具有较高的链路平均吞吐量和资源效率。     

Ant colony optimization based packet scheduler for peer-to-peer video streaming

This letter describes a new packet scheduling algorithm for enhancing the quality of distributed peer-to-peer video streaming. The algorithm was designed for when streaming server peers use error recovery such as automatic-repeat-request (ARQ) rather than error protection to avoid overburdening network resources. Ant colony optimization was used for scheduling groups of packets to reflect the channel status and error recovery effect of multiple server peers heuristically. Simulation results show that the proposed algorithm can enhance the quality of distributed video streaming services.     

Novel optimal real‐time admission control and buffer management for the Video‐On‐Demand (VOD) service

In order to meet the Quality of Service (QoS) requirements of the VOD service, and, on the other hand, to maximize the system throughput (revenue), it is essential that the video call request admission control algorithm be carefully designed. In this paper, in addition to the Single Segment (SS) admission control first described in [7], we propose two new types of admission control schemes called Segmental Re‐tuned (SR) admission control and Multiple Segment (MS) admission control for variable‐bit‐rate video streams under various video server architectures. The basic approach to the algorithm development is first to formulate each problem as a mathematical problem and then to identify special structures and properties for such formulations so that optimal real‐time algorithms can be developed. In computational experiments, it is shown that the proposed algorithms for the considered video server architectures, compared with the traditional admission control scheme based upon the peak frame size, typically achieve over 175–200% improvement in the system throughput. In addition, the new proposed MS scheme performs 5–25% better than SS and SR schemes. This revised version was published online in June 2006 with corrections to the Cover Date.     

一种基于校园网的流媒体拥塞控制路由策略

文章针对6PE校园网的特点,提出一种基于节点拥塞度约束的拥塞控制路由算法,在保证用户流QoS请求的同时,通过调整节点拥塞度来进行负载均衡,从而达到拥塞避免的目的.仿真实验结果表明,该策略能从一定程度上提高网络吞吐量及减少请求包的阻塞率,有利于流媒体传输.     

Optimal real-time admission control algorithms for thevideo-on-demand (VOD) service

In order to meet the quality-of-service (QOS) requirements of the VOD (video-on-demand) service, and, on the other hand, to maximize the system throughput (revenue), it is essential that the admission control algorithm be carefully designed. Two new types of admission control schemes for the VOD service are proposed. They are the enhanced strict admission control (ESAC) and the probabilistic admission control (PAC). In the ESAC schemes, we propose to use more statistics (of small amount and easily pre-calculated) than the peak frame size of the stored video information to strictly guarantee the QOS requirement and to achieve potentially much higher throughput. In the PAC schemes, we propose to use similar statistics as used in the ESAC schemes to achieve even higher throughput at the cost of some small and controllable likelihood of lost/overdue data. The admission control problems are formulated as feasibility problems where different systems of simultaneous equations are considered. For each admission control scheme, if the corresponding system of simultaneous equations has a feasible solution, then admit the call request; otherwise, reject the call. Special structures of the systems are identified so as to facilitate the development of optimal real-time admission control algorithms. Efficient optimal algorithms are also proposed to calculate the minimal buffer requirement for a given performance objective     

Radio resource management of heterogeneous services in mobile WiMAX systems [Radio Resource Management and Protocol Engineering for IEEE 802.16]

IEEE 802.16e, known as mobile WiMAX, has gained much attention recently for its capability to support high transmission rates in cellular environments and QoS for different applications. Beyond what the standard can define, in order to effectively support video streaming, VoIP, and data services, proprietary radio resource management, including multiconnection assignment, scheduling controls, and call admission controls, are essential. In this study we evaluate the downlink performance of a mobile WiMAX cellular system with different radio resource management, especially the scheduler for QoS control and the implementation of multiconnection for streaming applications     

Scalable 3D video streaming over P2P networks with playback length changeable chunk segmentation

3D video distribution over P2P networks has been thought as a promising way for 3D video entering home. The convergence of scalable 3D video coding and P2P streaming can provide diverse 3D experiences for heterogeneous clients with high distribution efficiencies. However, the conventional chunk segmentation and scheduling algorithms originally aiming at the non-scalable 2D video streaming are not very efficient for scalable 3D video streaming over P2P networks due to the particular data characteristics of scalable 3D video. Based on this motivation, this paper first presents a playback length changeable 3D video chunk segmentation (PLC3DCS) algorithm to provide different error resilience strengths to video and depth as well as layers with different importance levels in the 3D video transmission. Then, a hybrid-priority based chunk scheduling (HPS) algorithm is proposed to be tied in with the proposed chunk segmentation algorithm to further promote the overall 3D video P2P streaming performance. The simulation results show that the proposed PLC3DCS algorithm with the corresponding HPS can increase the success delivery rates of chunks with more important levels, and further improve the user’s quality of 3D experience.     

多优先级的异构网络多路径并行视频传输算法

为了在异构网络环境中使用多路径高效的并行传输高质量的视频流,本文针对H.264视频编码中不同的图像帧丢失后对解码造成的不同影响,提出了一种多优先级的多路径并行视频分配算法。所提出的算法将不同图像帧分成两个优先级,并根据整个网络的实时状态动态的把视频流分配到不同的路径中,使得系统在接收端丢失最少的图像帧。仿真结果表明,所提出的算法可以大大减少网络的丢帧率,提升网络传输视频数据性能。      

A game theoretic approach to minimum-delay scalable video transmission over P2P

In this paper we describe a game theoretic framework for scalable video streaming over a peer-to-peer network. The proposed system integrates minimum delay functionalities with an incentive provision mechanism for optimal resource allocation. First of all, we introduce an algorithm for packet scheduling that allows users to download a specific sub-set of the original scalable bit-stream, depending on the current network conditions. Furthermore, we present an algorithm that aims both at identifying free-riders and minimising the transmission delay. Uncooperative peers are cut out of this system, while users upload more data to those which have less to share, in order to fully exploit the resources of all peers. Experimental evaluation shows that the proposed model can effectively cope with free-riders and minimise the transmission delay for scalable video transmission by exploiting a packet scheduling algorithm, game theory, and a minimum-delay algorithm.     

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视频流媒体体系下的帧位分配算法

针对移动P2P流媒体系统中存在多视频源的特点,提出了多视频源串行和并行调度算法。串行调度算法,接收Peer通过实时侦测的QoS变化触发视频源的更换,并通过流序列时间模型来同步各个视频源。并行调度算法,多个视频源同时提供服务,并通过帧位分配算法分配各视频源的传输任务。帧位分配算法首先将视频序列分成包含固定帧数的块系列,然后进行块级位分配以充分考虑帧间效应。对于单个帧块位分配问题,算法将其建模成了非线性规划问题,通过引入分段线性R-D模型将该问题进一步转换成了普通的线性规划问题,并提出了一个贪婪实现策略。实验结果显示流分配算法能获得高效、平稳的视频质量,而且时间效率也非常高,能较好的满足移动P2P视频流媒体系统的实时性。     

Fair admission control scheme based on conditional preemption in traffic-groomed optical networks

In optical-grooming networks, the capacity fairness issue can be resolved by utilizing a call admission control mechanism. Existing call admission control schemes are generally based on one of the four different techniques, namely static bandwidth reservation (SBR), static threshold setting (STS), mathematical statistics (MS), and Markov decision processing without buffer implementation (NB). However, irrespective of the technique used, a tradeoff exists between the network fairness and the network throughput. Accordingly, this article presents a conditional-preemption call admission control (CP-CAC) scheme designed to increase the network throughput while simultaneously maintaining the fairness. The CP-CAC method is based on a dynamic threshold setting concept and is implemented using a single connection buffer (C-Buf) and a set of virtual buffers (V-Bufs). In general CAC mechanisms, if the residual bandwidth is sufficient to satisfy a new request but some requests are already buffered, the new request can be treated in two different modes, i.e. with-preemption (WP) or without-preemption (NP). In contrast, in the CP-CAC scheme proposed in this study, a conditional-preemption (CP) mode is proposed in which statistical information about the blocking probability is used to determine the preempt (or not) decision. The simulation results show that compared to the NB call admission control mechanism, the proposed CP-CAC scheme improves the network throughput without sacrificing the fairness. In addition, the average waiting time induced by the buffer implementation is just 0.25 time units. Finally, it is shown that the proposed method ensures fairness in a variety of common network topologies, including 6 × 6 mesh-torus, NSF, and Cost 239.     

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.