The Experts below are selected from a list of 52056 Experts worldwide ranked by ideXlab platform
Darrell D E Long - One of the best experts on this subject based on the ideXlab platform.
-
zero delay broadcasting protocols for Video on Demand
ACM Multimedia, 1999Co-Authors: Jehanfrancois Pâris, Darrell D E Long, Patrick E ManteyAbstract:Broadcasting protocols for Video-on-Demand continuously retransmit Videos that are watched simultaneously by many viewers. Nearly all broadcasting protocols assume that the client set-top box has enough storage to store between 48 and 60 minutes of Video. We propose to use this storage to anticipate the customer requests and to preload, say, the first 3 minutes of the top 16 to 20 Videos. This would provide instantaneous access to these Videos and also eliminate the extra bandwidth required to handle compressed Video signal. We present two broadcasting protocols using partial preloading to eliminate this extra bandwidth. The first of these protocols, Polyharmonic Broadcasting with Partial Preloading (PHB-PP), partitions each Video into between 20 and 160 segments of equal duration and allocates a separate data stream to each individual segment. Our second protocol, the Mayan Temple Broadcasting protocol, uses fewer data streams but requires more overall bandwidth.
-
hybrid broadcasting protocol for Video on Demand
Conference on Multimedia Computing and Networking, 1998Co-Authors: J F Paris, Steven W Carter, Darrell D E LongAbstract:Broadcasting protocols can improve the efficiency of Video on Demand services by reducing the bandwidth required to transmit Videos that are simultaneously watched by many viewers. It has been recently shown that broadcasting protocols using a very large number of very low bandwidth streams for each Video required less total bandwidth than protocols using a few high-bandwidth streams shared by all Videos. We present a hybrid broadcasting protocol that combines the advantages of these two classes of protocols. Our pagoda broadcasting protocol uses only a small number of high-bandwidth streams and requires only slightly more bandwidth than the best extant protocols to achieve a given maximum waiting time.
-
a low bandwidth broadcasting protocol for Video on Demand
International Conference on Computer Communications and Networks, 1998Co-Authors: J F Paris, Steven W Carter, Darrell D E LongAbstract:Broadcasting protocols can improve the efficiency of Video on Demand services by reducing the bandwidth required to transmit Videos that are simultaneously watched by many viewers. We present a polyharmonic broadcasting protocol that requires less bandwidth than the best extant protocols to achieve the same low maximum waiting time. We also show how to modify the protocol to accommodate very long Videos without increasing the buffering capacity of the set-top box.
-
efficient broadcasting protocols for Video on Demand
Modeling Analysis and Simulation On Computer and Telecommunication Systems, 1998Co-Authors: J F Paris, Steven W Carter, Darrell D E LongAbstract:Broadcasting protocols can improve the efficiency of Video on Demand services by reducing the bandwidth required to transmit Videos that are simultaneously watched by many viewers. We present two broadcasting protocols that achieve nearly the same low bandwidth as the best extant broadcasting protocol while guaranteeing a lower maximum access time. Our first protocol, cautious harmonic broadcasting, requires somewhat more bandwidth than our second protocol, quasi-harmonic broadcasting, but is also much simpler to implement.
-
improving Video on Demand server efficiency through stream tapping
International Conference on Computer Communications and Networks, 1997Co-Authors: Steve W Carte, Darrell D E LongAbstract:Efficiency is essential for Video-on-Demand (VOD) to be successful. Conventional VOD servers are inefficient, they dedicate a disk stream for each client, quickly using up all available streams. However, several systems have been proposed that allow clients to share streams. We present a new system called stream tapping that allows a client to greedily "tap" data from any stream on the VOD server containing Video data the client can use. This is accomplished through the use of a small buffer on the client set-top box and requires less than 20% of the disk bandwidth used by conventional systems for popular Videos. We present a description and analysis of the stream tapping system as well as comparisons between it and other efficiency-improving systems.
Dinesh Venkatesh - One of the best experts on this subject based on the ideXlab platform.
-
popularity based assignment of movies to storage devices in a Video on Demand system
Multimedia Systems, 1995Co-Authors: Thomas D C Little, Dinesh VenkateshAbstract:A Video-on-Demand server must satisfy a large customer base and a diverse archive of movies under changing movie popularity and daily load peaks. These requirements must be satisfied under the constraints imposed by storage device costs, capacities, I/O bandwidths, and geographic locations. In this paper we describe a partitioning of Video data (movies) onto a Video-on-Demand storage hierarchy to achieve efficient storage and I/O bandwidth use. Our approach uses a probabilistic model of movie popularity in data distribution and replication to balance user requests with available disk I/O bandwidth. The results can be applied in the design of a general, distributed Video-on-Demand system.
-
prospects for interactive Video on Demand
IEEE MultiMedia, 1994Co-Authors: Thomas D C Little, Dinesh VenkateshAbstract:Interactive multimedia systems are rapidly evolving from marketing hype and research prototypes to commercial deployments.We survey the technological issues for designing a large-scale, distributed, interactive multimedia system.
-
a digital on Demand Video service supporting content based queries
ACM Multimedia, 1993Co-Authors: Thomas D C Little, Gulrukh Ahange, R J Folz, Joh F Gibbo, F W Reeve, D H Schelleng, Dinesh VenkateshAbstract:Video-on-Demand represents a key demonstrative application for enabling multimedia technology in communication, database, and interface research. This application requires solving a number of diverse technical problems including the data synchronization problem for time-dependent data delivery. In this paper we describe the general requirements of Video-on-Demand and introduce a system supporting content-based retrieval and playback for the structure and content of digital motion pictures. In our model we capture domain-specific information for motion pictures and provide access to individual scenes of movies through queries on a temporal database. We describe our implementation of this service using existing workstation and storage technology.
Dafu Deng - One of the best experts on this subject based on the ideXlab platform.
-
hhmsm a hierarchical hybrid multicast stream merging scheme for large scale Video on Demand systems
International Conference on Multimedia and Expo, 2003Co-Authors: Dafu DengAbstract:The key performance bottleneck for large-scale Video-on-Demand (VoD) systems is the server bandwidth, which controls the number of clients a Video server can support. Two existing stream scheduling schemes can save server bandwidth significantly by using multicast method to transmit Video data: the batching scheme and the patching scheme. However, the batching scheme results in long start-up latency and high reneging probability. The patching scheme does not work well at high client request rates due to mass retransmission for same Video data. In this paper, we propose a hierarchical hybrid multicast stream merging scheme, called HHMSM, which can save server bandwidth significantly over a wide range of client request rates. Furthermore, the start-up latency raised by the HHMSM scheme is far less than that of the batching scheme.
-
a dynamically grouped multi multicast stream scheduling strategy for Video on Demand systems
International Conference on Computational Science, 2003Co-Authors: Dafu DengAbstract:Network bandwidth is the key performance bottleneck for a Videoon-Demand (VoD) server. It controls the number of clients the server can support simultaneously. Previous works have shown some strategies, such as the batching strategy and the stream merging strategy, that use one multicast stream to serve different clients requesting the same Video object at the same time. They improve the performance of server bandwidth effectively. But the batching strategy results in long start-up latency and the traditional stream merging strategy also wastes lots of server bandwidth. In this paper, we propose a dynamically grouped multi-multicast stream scheduling strategy, called DGMM, and analyze its performance in two factors: the start-up latency and the average bandwidth consumption.
Keith W Ross - One of the best experts on this subject based on the ideXlab platform.
-
can internet Video on Demand be profitable
ACM Special Interest Group on Data Communication, 2007Co-Authors: Cheng Huang, Keith W RossAbstract:Video-on-Demand in the Internet has become an immensely popular service in recent years. But due to its high bandwidth requirements and popularity, it is also a costly service to provide. We consider the design and potential benefits of peer-assisted Video-on-Demand, in which participating peers assist the server in delivering VoD content. The assistance is done in such a way that it provides the same user quality experience as pure client-server distribution. We focus on the single-Video approach, whereby a peer only redistributes a Video that it is currently watching. Using a nine-month trace from a client-server VoD deployment for MSN Video, we assess what the 95 percentile server bandwidth costs would have been if a peer-assisted employment had been instead used. We show that peer-assistance can dramatically reduce server bandwidth costs, particularly if peers prefetch content when there is spare upload capacity in the system. We consider the impact of peer-assisted VoD on the cross-traffic among ISPs. Although this traffic is significant, if care is taken to localize the P2P traffic within the ISPs, we can eliminate the ISP cross traffic while still achieving important reductions in server bandwidth. We also develop a simple analytical model which captures many of the critical features of peer-assisted VoD, including its operational modes.
-
Video on Demand over atm constant rate transmission and transport
IEEE Journal on Selected Areas in Communications, 1996Co-Authors: J M Mcmanus, Keith W RossAbstract:We introduce a specific transport and transmission scheme for Video-on-Demand (VoD) called constant-rate transmission and transport (CRTT). CRTT establishes a constant bit-rate (CBR) virtual channel between the Video provider and the viewer's set-top box (STB) and then transmits cells from the provider into this channel at a constant rate. Since we assume that the number of cells in a frame is variable, CRTT requires that some number of cells be built up in an STB buffer before the commencement of playback. The build up, cell transmission rate, and the set-top memory size must be chosen so that there is no starvation or overflow at the STB. We develop fundamental relationships between these parameters for viable CRTT. We then apply the theory to an MPEG encoding of Star Wars and find that the minimal STB memory far CRTT is 23 Mbytes. We also consider varying the constant rate over a small number of intervals. We find, for example, that for Star Wars approximately 2 Mbytes of set-top memory suffices with 32 constant-rate intervals.
-
Video on Demand over atm constant rate transmission and transport
International Conference on Computer Communications, 1996Co-Authors: J M Mcmanus, Keith W RossAbstract:We introduce a specific transport and transmission scheme for Video-on-Demand called constant-rate transmission and transport (CRTT). CRTT establishes a CBR virtual channel between the Video provider and the viewer's set-top box, and then transmits cells from the provider into this channel at a constant rate. Since we assume that the number of cells in a frame is variable, CRTT requires that some number of cells be built up in a set-top box buffer before the commencement of playback. The build up, cell transmission rate, and the set-top memory size must be chosen so that there is no starvation or overflow at the set-top box. We develop fundamental relationships between these parameters for viable CRTT. We then apply the theory to an MPEG encoding of Star Wars and find that the minimal set-top box memory for CRTT is 23 Mbytes. We also consider varying the constant rate over a small number of intervals. We find, for example, that for Star Wars approximately 2 Mbytes of set-top memory suffices with 32 constant-rate intervals.
Thomas D C Little - One of the best experts on this subject based on the ideXlab platform.
-
popularity based assignment of movies to storage devices in a Video on Demand system
Multimedia Systems, 1995Co-Authors: Thomas D C Little, Dinesh VenkateshAbstract:A Video-on-Demand server must satisfy a large customer base and a diverse archive of movies under changing movie popularity and daily load peaks. These requirements must be satisfied under the constraints imposed by storage device costs, capacities, I/O bandwidths, and geographic locations. In this paper we describe a partitioning of Video data (movies) onto a Video-on-Demand storage hierarchy to achieve efficient storage and I/O bandwidth use. Our approach uses a probabilistic model of movie popularity in data distribution and replication to balance user requests with available disk I/O bandwidth. The results can be applied in the design of a general, distributed Video-on-Demand system.
-
network and operating systems support for digital audio and Video 5th international workshop nossdav 95 durham new hampshire usa april 19 21 1995 proceedings
1995Co-Authors: Thomas D C Little, Riccardo GusellaAbstract:Advance reservations for predictive service.- Distributed advance reservation of real-time connections.- Issues of reserving resources in advance.- A computational and engineering view on open distributed real-time multimedia exchange.- Support for user-centric modular real-time resource management in the Rialto operating system.- A rate-based execution abstraction for multimedia computing.- VuSystem performance measurements.- Design of universal continuous media I/O.- A new OS architecture for high performance communication over ATM Networks.- Meeting arbitrary QoS constraints using Dynamic Rate Shaping of coded digital Video.- Dynamic QoS management for scalable Video flows.- Dynamic service aggregation for efficient use of resources in interactive Video delivery.- Evaluation of QOS-Control Servers on Real-Time Mach.- System-level resource management for network-based multimedia applications.- Session IV: A NOSSDAV retrospective.- An end to end software only scalable Video delivery system.- A distributed real-time MPEG Video audio player.- Analysis of audio packet loss in the internet.- Digital audio and Video in industrial systems.- Workstation Video playback performance with competitive process load.- When can we unplug the radio and telephone?.- An Adaptive Stream Synchronization Protocol.- A Method and apparatus for measuring media synchronization.- Integrated processor scheduling for multimedia.- Scheduling and admission testing for jitter constrained periodic threads.- A CPU scheduling algorithm for continuous media applications.- Dynamic configuration of conferencing applications using pattern-matching multicast.- WAVE: A new multicast routing algorithm for static and dynamic multicast groups.- Connection establishment for multi-party real-time communication.- The role of multicast communication in the provision of scalable and interactive Video-on-Demand service.- RED-VBR: A new approach to support delay-sensitive VBR Video in packet-switched networks.- Determining end-to-end delay bounds in heterogeneous networks.- Adaptive QoS-based API for ATM networking.- Burst scheduling networks: Flow specification and performance guarantees.- A novel Video-on-Demand storage architecture for supporting constant frame rate with variable bit rate retrieval.- The design and implementation of a RAID-3 multimedia file server.- Efficient data layout, scheduling and playout control in MARS.- Storage replication and layout in Video-on-Demand servers.- Scalable MPEG2 Video servers with heterogeneous QoS on parallel disk arrays.- The design of a variable bit rate continuous media server.
-
prospects for interactive Video on Demand
IEEE MultiMedia, 1994Co-Authors: Thomas D C Little, Dinesh VenkateshAbstract:Interactive multimedia systems are rapidly evolving from marketing hype and research prototypes to commercial deployments.We survey the technological issues for designing a large-scale, distributed, interactive multimedia system.
-
a digital on Demand Video service supporting content based queries
ACM Multimedia, 1993Co-Authors: Thomas D C Little, Gulrukh Ahange, R J Folz, Joh F Gibbo, F W Reeve, D H Schelleng, Dinesh VenkateshAbstract:Video-on-Demand represents a key demonstrative application for enabling multimedia technology in communication, database, and interface research. This application requires solving a number of diverse technical problems including the data synchronization problem for time-dependent data delivery. In this paper we describe the general requirements of Video-on-Demand and introduce a system supporting content-based retrieval and playback for the structure and content of digital motion pictures. In our model we capture domain-specific information for motion pictures and provide access to individual scenes of movies through queries on a temporal database. We describe our implementation of this service using existing workstation and storage technology.
