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
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)
Competitive on-line stream merging algorithms for media-on-demand
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computer Networking: A Top-Down Approach Featuring the Internet
Computer Networking: A Top-Down Approach Featuring the Internet
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
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
Competitive Analysis of On-line Stream Merging Algorithms
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On-line stream merging in a general setting
Theoretical Computer Science - Computing and combinatorics
Competitive on-line stream merging algorithms for media-on-demand
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Scalable media streaming to interactive users
Proceedings of the 13th annual ACM international conference on Multimedia
Optimizing the quality of scalable video streams on P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Network bandwidth requirements for optimized streaming media transmission to interactive users
WebMedia '06 Proceedings of the 12th Brazilian Symposium on Multimedia and the web
Workload-aware resource sharing and cache management for scalable video streaming
IEEE Transactions on Circuits and Systems for Video Technology
On-line stream merging, max span, and min coverage
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Hi-index | 0.00 |
We study the stream merging problem for media-on-demand servers. Clients requesting media from the server arrive by a Poisson process, and delivery to the clients starts immediately. Clients are prepared to receive up to two streams at any time, one or both being fed into a buffer cache. We present an on-line algorithm, the dyadic stream merging algorithm, whose recursive structure allows us to derive a tight asymptotic bound on stream merging performance. In particular, let λ be the Poisson request arrival rate, and let L be the fixed media length. Then the long-time ratio of the expected total stream length under the dyadic algorithm to that under an algorithm with no merging is asymptotically equal to 3/log(λL)2λL;. Furthermore, we establish the near-optimality of the dyadic algorithm by comparisons with experimental results obtained for an optimal algorithm constructed as a dynamic program. The dyadic algorithm and the best on-line algorithm of those recently proposed differ by less than a percent in their comparison with an off-line optimal algorithm. Finally, the worst-case performance of our algorithm is shown to be no worse than that of earlier algorithms. Thus, the dyadic algorithm appears to be the first near optimal algorithm that admits a rigorous average-case analysis.