Journal ArticleDOI
Hierarchical video patching with optimal server bandwidth
Helmut Hlavacs,Shelley Buchinger +1 more
Reads0
Chats0
TLDR
This work presents a novel video patching scheme using hierarchies of patches that minimizes the bandwidth needed by the video server, and may result in the fact that clients receive several streams in parallel.Abstract:
Video patching is a way for transporting true video-on-demand, that is, instantaneous without any delay, from a video server to several clients. Instead of sending a unique stream to each newly arriving client, clients share as many multicast transmissions as possible, and are serviced only those parts of the video that they have missed.We present a novel video patching scheme using hierarchies of patches. Our scheme minimizes the bandwidth needed by the video server, and may result in the fact that clients receive several streams in parallel. We show analytically that for Poisson arrival our algorithm achieves the optimal possible server bandwidth for all schemes where clients share multicast transmissions.We also show, how our approach can be combined with batching. This combination requires less server bandwidth than all fixed start point periodic broadcast algorithms.read more
Citations
More filters
Journal ArticleDOI
Energy-Aware and Bandwidth-Efficient Hybrid Video Streaming Over Mobile Networks
TL;DR: This work proposes to concurrently utilize unicast and multicast for minimizing the energy consumption of mobile devices and minimizing the load on cellular networks, and describes optimal algorithms for the two multicast schemes.
Journal ArticleDOI
Reducing channel change delay in IPTV by predictive pre-joining of TV channels
TL;DR: By analysing an extensive dataset from an operational IPTV provider – comprising 255 thousand users, 150 TV channels, and covering a 6-month period – it is observed that most channel switching events are relatively predictable: users very frequently switch linearly, up or down to the next TV channel.
Patent
Synchronization of clients to maximize multicast opportunities
Alan L. Glasser,Andrew G. Gauld,Vijay Gopalakrishnan,John F. Lucas,Kadangode K. Ramakrishnan +4 more
TL;DR: A content monitor includes a processor that at least receives requests from a plurality of clients for content, instructs each client to retry their respective request at a first later time if the request is received before a first time, counts the requests to determine if a number of the requests exceeds a threshold, and counts a number late clients joining the multicast group after a first portion of the content has been sent to the multicasting group as discussed by the authors.
Journal ArticleDOI
On guaranteed VoD services in next generation optical access networks
TL;DR: An integrated Gigabit Passive Optical Network (GPON) and Wavelength Division Multiplexing PON (WDM PON) architecture and a heuristic algorithm which can achieve near-optimal WPD is proposed for coordinated OLT broadcast scheduling and ONU patching.
Proceedings ArticleDOI
Multicast Video-on-Demand Service in an Enterprise Network with Client-Assisted Patching
S. M. Farhad,Md. Mostofa Akbar +1 more
TL;DR: This research adopts multicast communication technique in an enterprise network where multimedia data are stored in distributed servers and considers batching with patching, a novel patching scheme called client-assisted patching which outperforms conventional patching.
References
More filters
Proceedings ArticleDOI
Scheduling policies for an on-demand video server with batching
TL;DR: It is shown that an FCFS policy that schedules the movie with the longest outstanding request can perform better than the MQL policy that chooses the film with the maximum number of outstanding requests.
Proceedings ArticleDOI
Patching: a multicast technique for true video-on-demand services
Kien A. Hua,Ying Cai,Simon Sheu +2 more
TL;DR: This paper is able to tiate the service latency and improve the efficiency of mtiticast at the same time, and indicates convincingly that Patching offers .wbstanti~y better perforrnace.
Minimizing Bandwidth Requirements for On-Demand Data Delivery.
TL;DR: In this article, the authors compared the performance of the partitioned dynamic skyscraper and hierarchical multicast stream merging (HMSM) over a wide range of client request rates.
Proceedings ArticleDOI
Video-on-demand broadcasting protocols: a comprehensive study
TL;DR: A generalized analytical approach to evaluate the efficiency of the broadcasting protocols and derive the theoretical lower bandwidth requirement bound for any periodic broadcasting protocols is proposed and a proof why existing techniques such as smoothing and prefetching is not necessary and in some cases inefficient is given.
Proceedings ArticleDOI
Optimal and efficient merging schedules for video-on-demand servers
TL;DR: The simplest video-on-demand (VOD) delivery policy is to allocate a new media delivery stream to each client request when it arrives, but it is untenable because it requires server bandwidth that scales linearly with the number of clients that must be supported simultaneously, which is too expensive for many applications.
Related Papers (5)
Patching: a multicast technique for true video-on-demand services
Kien A. Hua,Ying Cai,Simon Sheu +2 more