Reducing I/O demand in video-on-demand storage servers
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Dynamic batching policies for an on-demand video server
Multimedia Systems
On optimal piggyback merging policies for video-on-demand systems
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Metropolitan area video-on-demand service using pyramid broadcasting
Multimedia Systems
Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Patching: a multicast technique for true video-on-demand services
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Improving bandwidth efficiency of video-on-demand servers
IC3N '97 Selected papers of the 6th international conference on Computer communications and networks
Zero-delay broadcasting protocols for video-on-demand
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Optimal and efficient merging schedules for video-on-demand servers
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
An efficient bandwidth-sharing technique for true video on demand systems
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
The dyadic stream merging algorithm
Journal of Algorithms
Fast broadcasting for hot video access
RTCSA '97 Proceedings of the 4th International Workshop on Real-Time Computing Systems and Applications
Supplying Instantaneous Video-on-Demand Services Using Controlled Multicast
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
A Low Bandwidth Broadcasting Protocol for Video on Demand
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Exploiting Client Bandwidth for More Efficient Video Broadcast
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
A Permutation-Based Pyramid Broadcasting Scheme for Video-on-Demand Systems
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
On Optimal Batching Policies for Video-on-Demand Storage Servers
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
Video-on-Demand Server Efficiency through Stream Tapping
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Efficient Algorithms for Optimal Stream Merging for Media-on-Demand
SIAM Journal on Computing
Staircase data broadcasting and receiving scheme for hot video service
IEEE Transactions on Consumer Electronics
Enhanced harmonic data broadcasting and receiving scheme for popular video service
IEEE Transactions on Consumer Electronics
Quality of service evaluations of multicast streaming protocols
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scalable media streaming to interactive users
Proceedings of the 13th annual ACM international conference on Multimedia
Assessing the efficiency of stream reuse techniques in P2P video-on-demand systems
Journal of Network and Computer Applications
Network bandwidth requirements for optimized streaming media transmission to interactive users
WebMedia '06 Proceedings of the 12th Brazilian Symposium on Multimedia and the web
An optimal broadcasting protocol for mobile video-on-demand
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Hi-index | 0.03 |
We consider the problem of minimizing the bandwidth needed by media-on-demand servers that use stream merging. We consider the on-line case where client requests are not known ahead of time. To facilitate stream merging, clients have the ability to receive data from two streams simultaneously and can buffer up to half of a full stream. We present a new family of on-line stream merging algorithms called dynamic tree algorithms. The bandwidth requirements of the best of these, the dynamic Fibonacci tree algorithms, are within a factor of the minimum between logφ(n) + O(1) and logφ(1/(2D)) + O(1) from the off-line optimal, where n is the number of requests, D is the guaranteed maximum start-up delay measured as a fraction of the time for a full stream, and φ = (1 + √5)/2. The new on-line algorithms use a dynamic Fibonacci tree to control how new arrivals should merge with existing streams. Empirical studies show that the dynamic Fibonacci tree algorithms perform much better than indicated by the analysis.