Throughput optimization for video streaming proxy servers based on video staging

A video streaming proxy server needs to handle hundreds of simultaneous connections between media servers and clients. Inside, every video arrived at the server and delivered from it follows a specific arrival and delivery schedule. While arrival schedules compete for incoming network bandwidth, delivery schedules compete for outgoing network bandwidth. As a result, a proxy server has to provide sufficient buffer and disk cache for storage, together with memory space, disk space and disk bandwidth. In order to optimize the throughput, a proxy server has to govern the usage of these resources. In this paper, we first analyze the property of a traditional smoothing algorithm and a video staging algorithm. Then we develop, based on the smoothing algorithm, a video staging algorithm for video streaming proxy servers. This algorithm allows us to devise an arrival schedule based on the delivery schedule. Under this arrival and delivery schedule pair, we can achieve a better resource utilization rate gracefully between different parameter sets. It is also interesting to note that the usage of the resources such as network bandwidth, disk bandwidth and memory space becomes interchangeable. It provides the basis for inter-resource scheduling to further improve the throughput of a video streaming proxy server system.

A scalable cost-effective video broadcasting system for on-demand video services

Recent years have seen intensive investigations of Periodic Broadcast, an attractive paradigm for broadcasting popular videos. In this paradigm, the server simply broadcasts segments of a popular video periodically on a number of communication channels. A large number of clients can be served simultaneously by tuning into these channels to receive segments of the requested video. A playback can begin as soon as a client can access the first segment. Periodic Broadcast guarantees a small maximum service delay regardless of the number of concurrent clients. Existing periodic broadcast techniques are typically evaluated through analytical assessment. While these results are good performance indicators, they cannot demonstrate subtle implementation difficulty that can prohibit these techniques from practical deployment. In this paper, we present the design and implementation of a video broadcasting system based on our periodic broadcast scheme called Striping Broadcast. Our experience with the system confirms that the system offers a low service delay close to its analytical guaranteed delay while requiring small storage space and low download bandwidth at a client.     

An enhanced client-centric approach for efficient video broadcast

Periodic broadcast is a cost-effective solution for large-scale distribution of popular videos. Regardless of the number of video requests, this strategy guarantees a constant worst service latency to all clients, making it possible to serve a large community with a minimal amount of broadcast bandwidth. Although many efficient periodic broadcast techniques have been proposed, most of them impose rigid requirements on client receiving bandwidth. They either demand clients to have the same bandwidth as the video server, or limit them to receive no more than two video streams at any one time. In our previous work, we addressed this problem with a Client-Centric Approach (CCA). This scheme takes into consideration both server broadcast bandwidth and client receiving bandwidth and allows clients to use all their receiving capability for prefetching broadcast data. As a result, given a fixed broadcast bandwidth, a shorter broadcast period can be achieved with an improved client communication capability. In this paper, we present an enhanced version of CCA to further leverage client bandwidth for more efficient video broadcast. The new scheme reduces the broadcast latency up to 50% as compared to CCA. We prove the correctness of this new technique and provide an analytical evaluation to show its performance advantage as compared with some existing techniques.

Periodic broadcast and patching services - implementation,measurement and analysis in an internet streaming video testbed

Multimedia streaming applications can consume a significant amount of server and network resources. Periodic broadcast and patching are two approaches that use multicast transmission and client buffering in innovative ways to reduce server and network load, while at the same time allowing asynchronous access to multimedia streams by a large number of clients. Current research in this area has focussed primarily on the algorithmic aspects of these approaches, with evaluation performed via analysis or simulation. In this paper, we describe the design and implementation of a flexible streaming video server and client test bed that implements both periodic broadcast and patching, and explore the issues that arise when implementing these algorithms using laboratory and internet-based test beds. We present measurements detailing the overheads associated with the various server components (signaling, transmission schedule computation, data retrieval and transmission), the interactions between the various components of the architecture, and the overall end-to-end performance. We also discuss the importance of an appropriate server application-level caching policy for reducing the needed disk bandwidth at the server. We conclude with a discussion of the insights gained from our implementation and experimental evaluation.Subhabrata Sen: The work of this author was conducted while he was at the University of Massachusetts.     

移动流媒体选播系统控制服务器研究

从媒体选播系统整体结构和功能需求出发,详细分析了移动流媒体选播系统中控制服务器和媒体数据服务器的功能和主要业务流程,然后研究选播系统中控制服务器设计和实现方案。     

Optimized scalable cache management for video streaming system

An important research issue in video streaming is how to efficiently utilize the network resources to provide clients instant access to multiple video objects. Caching strategy and transmission scheme are the two essential points inside the video streaming framework. Recent research efforts on them are not sufficient due to their inflexible support for scalable encoded video streams and heterogeneous requests from clients. In this paper, we propose an optimized caching strategy (OCS) and a scalable transmission scheme (STS) for scalable coded video streaming. By exploring the characteristics of video streaming workload and system design objectives, OCS and STS work efficiently to minimize both network bandwidth cost and user access latency. Firstly, we analyze the caching problem for the proxy-assisted video streaming system and derive a maneuverable caching scenario. Secondly, we develop an efficient transmission scheme for scalable coded videos. Thirdly, we formulate a multi-objective optimization model with closed-form expressions to obtain the optimized caching strategy. Finally, with designed algorithms, an excellent compromise between two competing objectives (minimizing the bandwidth cost and the access latency) is achieved. We start our evaluation by studying the optimized caching strategy for a single video object. Then we apply the strategy to multiple video objects and illustrate the tradeoff between the optimization objectives. Our evaluation results show that compared with other caching strategies, the proposed optimized scalable caching strategy can achieve a significant reduction in bandwidth cost with even a small proxy cache size. Meanwhile, the best performance (in terms of bandwidth cost) is obtained together with the proposed scalable batch-patching transmission scheme.

XOR-based frame loss recovery scheme for video streaming

High coding dependencies among video frames suffer from vulnerability to packet loss, which impacts the playback quality of video streaming. In this paper, according to the characteristics of MPEG4/H.264 encoding methods, we propose a simple and low-complexity XOR-based FEC frame loss recovery scheme. Within an entire Group of Pictures (GOP), the proposed scheme shows the ability to recover simultaneously I-frame loss and one P-frame loss. The high frame loss resilience improves the playback QoS of compressed video streaming. The mathematical analysis reveals that the proposed scheme has 72.7% performance improvement than no frame loss protection in term of full GOP frames successful decoding rate.     

OCS: An effective caching scheme for video streaming on overlay networks

Video streaming is vital for many important applications such as distance learning, digital video libraries, and movie-on-demand. Since video streaming requires significant server and networking resources, caching has been used to reduce the demand on these resources. In this paper, we propose a novel collaboration scheme for video caching on overlay networks, called Overlay Caching Scheme (OCS), to further minimize service delays and loads placed on an overlay network for video streaming applications. OCS is not a centralized nor a hierarchical collaborative scheme. Despite its design simplicity, OCS effectively uses an aggregate storage space and capability of distributed overlay nodes to cache popular videos and serve nearby clients. Moreover, OCS is light-weight and adaptive to clients’ locations and request patterns. We also investigate other video caching techniques for overlay networks including both collaborative and non-collaborative ones. Compared with these techniques on topologies inspired from actual networks, OCS offers extremely low average service delays and approximately half the server load. OCS also offers smaller network load in most cases in our study.

Periodic broadcast with dynamic server selection

Service replication is an effective way to address resource requirements and resource availability problem. Dynamic service selection enables clients to choose a server offering the best performance. Proper server selection is especially important for video streaming over the Internet due to its high bandwidth requirements. However, given the length of a typical video transmission, the server priorly selected may no longer be an optimal one for the duration of the entire transmission. More importantly, a server may fail during the transmission of a video. In this paper we examine the possibility of switching to another server during an on-going transmission for Periodic Broadcast schemes. Due to the timing requirements typical for Periodic Broadcast the server switch may cause playback disruptions. We analyze the magnitude of the problem and propose an easy to implement solution. We define the criteria, additional to the bandwidth availability for example, according to which a new server should be selected. The client is also required to delay its playback by the amount of time bounded by the server transmission offset. In addition, we propose an alternative method to ensure uninterrupted playback that relies on proxy caching. Simulation results show that our approach can significantly reduce the likelihood of playback disruptions.

Parallel video streaming optimizing network throughput

In the Internet, video streaming services, in which users can enjoy videos at home, are becoming popular. Video streaming with high definition TV (HDTV) or ultra high definition video (UHDV) quality will be also provided and widely demanded in the future. However, the transmission bit-rate of high-quality video streaming is quite large, so generated traffic flows will cause link congestion. In the Internet, routes that packets take are determined using static link weights, so the network productivity, i.e., the maximum achievable throughout by the network, is determined by the capacity of a bottleneck link with the maximum utilization, although utilizations of many links remain low level. Therefore, when providing streaming services of rich content, i.e., videos with HDTV or UHDV quality, it is important to flatten the link utilization, i.e., reduce the maximum link utilization. We propose that ISPs use multiple servers to deliver rich content to balance the link utilization and propose server allocation and server selection methods for parallel delivery. We evaluate the effect of parallel delivery using 23 actual commercial ISP networks.     

A systematic rate controller for MPEG-4 FGS video streaming

This paper proposes a systematic rate controller (SRC) for content-aware streaming of MPEG-4 FGS video over the Internet. An active layer dropping technique is proposed to provide both coarse-grain and fine-granularity scalability of smooth quality adaptation to bandwidth fluctuations and bit-rate variations of streamed video over a general time-scale. The smooth quality adaptation is realized through the mode and state transition of a state machine that implements the SRC. The SRC effectively uses available bandwidth and client buffer by forward-shifting the FGS video stream. It provides protection to video segments with important content by introducing a content-aware priority-based layer model for the MPEG-4 FGS video stream. RID="*" ID="*" The work reported in this paper was performed when this author was working at Microsoft Research Asia as a research intern.     

A live video streaming system for intuitive human-system interaction

In this paper, we propose an intuitive live video streaming system based on virtual reality technologies among people who are far apart. This system is a kind of server-client system, and can provide remote users with virtual 3D audiovisual fields in real time via a very-high-speed network. The server captures audio and video data from its clients, compiles them into a 3D audiovisual scene at a virtual conference, and broadcasts it to the clients. At the present stage, our system captures 2 videos and creates one 3D video at a time. Our system can play 3D audiovisual contents on Windows XP systems as well as on CAVE systems. Currently, our system can play the 3D video contents at about 2.36 fps under a LAN environment. This work was presented in part at the 12th International Symposium on Artificial Life and Robotics, Oita, Japan, January 25–27, 2007     

Peer to peer video streaming in Bluetooth overlays

As Bluetooth is available in most personal and portable terminals (eg, cellular phone, PDA, videocamera, laptop, etc) Peer-to-peer video streaming through Bluetooth networks is now a reality. Camera equipped Bluetooth phones capture video and broadcast it to other Bluetooth devices and to the infrastructure. Tra ditionally, large scale Bluetooth networks were designed using scatternet concepts. However, many Bluetooth devices do not support Scatternet connections and, even if they support it, they provide only very limited features suitable mostly for static environments. In high mobility situations, a traditional Scatternet design is not useful because of frequent disconnections and reconnections. To overcome these problems, we propose overlaid Bluetooth Piconets (OBP) and simplified overlaid Bluetooth Piconets (SOBP) that interconnect Piconets forming virtual Scatternets. In OBP, every Piconet dynamically reconfigures to collect metadata from neighboring Piconets. If metadata shows the existence of useful data to transfer, an inter-Piconet connection is made to carry out the transfer. SOBP can be used instead of OBP once neighbor Piconets have already discovered each other. In this paper, we compare via analysis and simulation the throughput and efficiency of OBP, SOBP and Scatternet for video applications. We demonstrate the feasibility of video over OBP and SOBP for a representative application.

Loss tolerant video streaming authentication in heterogeneous wireless networks

Multicast video streaming in heterogeneous networks undergoes to very different physical constraints, in fact, such networks are characterized by different QoS parameters, involving one or more transcoding process between the sender and the receivers. Video streaming authentication algorithms must be robust to transcoding processes and must guarantee the copyright of the video owner/producer. We propose a real-time video streaming authentication algorithm that can guarantee the copyright of the video owner and that we prove to be robust to packet loss and transcoding processes.     

DAg-stream: Distributed video adaptation for overlay streaming to heterogeneous devices

Combining the advantages of Peer-to-Peer (P2P) content distribution concept and metadata driven adaptation of videos in compressed domain, in this paper, we propose a simple but scalable design of distributed adaptation and overlay streaming using MPEG-21 gBSD, called DAg-stream. The objective is not only to shift the bandwidth burden to end participating peers, but also to move the computation load for adapting video contents away from dedicated media-streaming/adaptation servers. It is an initiative to merge the adaptation operations and the P2P streaming basics to support the expansion of context-aware mobile P2P systems. DAg-stream organizes mobile and heterogeneous peers into overlays. For each video, a separate overlay is formed. No control message is exchanged among peers for overlay maintenance. We present a combination of infrastructure-centric and application end-point architecture. The infrastructure-centric architecture refers to a tree controller, named DAg-master, which is responsible for tree/overlay administering and maintenance. The application end-point architecture refers to video sharing, streaming and adaptation by the participating resourceful peers. The motivation for this work is based on the experiences and lessons learned so far about developing a video adaptation system for heterogeneous devices. In this article, we present our architecture and some experimental evaluations supporting the design concept for overlay video streaming and online adaptation.

The selective use of redundancy for video streaming over Vehicular Ad Hoc Networks

Video streaming over Vehicular Ad Hoc Networks (VANETs) offers the opportunity to deploy many interesting services. These services, however, are strongly prone to packet loss due to the highly dynamic topology and shared wireless medium inherent in the VANETs. A possible strategy to enhance the delivery rate is to use redundancy for handling packet loss. This is a suitable technique for VANETs as it does not require any interaction between the source and receivers.In this work, we discuss novel approaches for the use of redundancy based on the particularities of video streaming over VANETs. A thorough study on the use of redundancy through Erasure Coding and Network Coding in both video unicast and video broadcast in VANETs is provided. We investigate each strategy, design novel solutions and compare their performance. We evaluated the proposed solutions from the perspective not only of cost as bandwidth utilization, but also the offered receiving rate of unique video content at the application layer. This perspective is fundamental to understanding how redundancy can be used without limiting the video quality that can be displayed to end users.Furthermore, we propose the selective use of redundancy solely on data that is more relevant to the video quality. This approach offers increases in overall video quality without leading to an excessive overhead nor to a substantial decrease in the receiving rate of unique video content.     

Quality adaptive end-to-end packet scheduling to avoid playout interruptions in Internet video streaming systems

In Internet multimedia streaming, the quality of the delivered media can be adapted to the Quality of Service provided by the underlying network, thanks to encoding algorithms. These allow a fine grained enhancement of a low quality base layer at streaming time. The main objective that should be satisfied in such systems is to avoid the starvation of the decoding process and consequent playout interruptions. In this work, we tackle the problem using a control theoretic approach. In particular, we design and implement the novel end-to-end Quality Adaptive Scheduler for properly distributing the network available bandwidth among base and enhancement layers. The developed solution can be adopted in many contexts given that it has been designed without assumptions on the delivered media nor on the protocol stack. Anyway, to test its effectiveness, we have casted it in a H.264/AVC SVC based video streaming architecture for unicast Internet applications. The performance of the scheduler has been experimentally evaluated in both a controlled testbed and several “wild” Internet scenarios, including also UMTS and satellite radio links. Results have clearly demonstrated that our Quality Adaptive Scheduler is able to significantly improve the performance of the video streaming system in all operative conditions.     

A modeling framework of content pollution in Peer-to-Peer video streaming systems

Peer-to-Peer (P2P) live video streaming systems are known to suffer from intermediate attacks due to its inherent vulnerabilities. The content pollution is one of the common attacks that have received little attention in P2P live streaming systems. In this paper, we propose a modeling framework of content pollution in P2P live streaming systems. This model considers both unstructured and structured overlays, and captures the key factors including churns, user interactions, multiple attackers and defensive techniques. The models are verified with simulations and implemented in a real working system, Anysee. We analyze content pollution and its effect in live streaming system. We show that: (1) the impact from content pollution can exponentially increase, similar to the random scanning worms, leading to playback interruption and unnecessary bandwidth consumption; (2) content pollution is influenced by peer cooperation, peer degree and bandwidth in unstructured overlays, and topology breadth in structured ones; (3) the structured overlay is more resilient to content pollution; (4) a hybrid overlay result in better reliability and pollution resistance; (5) hash-based chunk signature scheme is most promising against content pollution.     

Full-sharing: efficient bandwidth scheduling for video streaming over broadband cable networks (BCNs)

Broadband Cable Networks (BCNs) bring high-speed Internet access to home and make emerging multimedia streaming applications feasible. However, bandwidth contention is still a challenging problem in providing efficient IP-based Video-On-Demand (VOD) service on BCNs, due to the lack of effective approaches to exploit the unique characteristics of BCNs. To address the bandwidth contention issue, we propose an efficient video scheduling technique, called full-sharing scheduling in this paper. This technique fully exploits the unique characteristics of BCNs to reduce the bandwidth consumption of video sessions sharing a cable channel of fixed capacity, thereby maximizing the number of simultaneous video sessions on the single channel. Furthermore, we analyze the expected bandwidth and the session blocking probability of a video under the full-sharing scheduling. Based on this analysis, we design an efficient video assignment mechanism for maximizing the profit of a VOD system in scheduling videos on BCNs. Through both analysis and simulation, we show that our approach minimizes the bandwidth consumption of video sessions compared with the previous approaches and has significant advantages on BCNs. The proposed approach is also directly applicable on other broadcast/multicast networks in which clients have sufficient buffer and downstream bandwidth, e.g., satellite broadband networks. This work was supported in part by the National Science Foundation under the grants ANI-0073819, ITR-0085824, and CAREER Award NCR-9734428. Any opinions, findings, and conclusions or recommendations expressed in this paper are those of the authors and do not necessarily reflect the views of the National Science Foundation.