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
Optimal and efficient merging schedules for video-on-demand servers
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Exploiting Client Bandwidth for More Efficient Video Broadcast
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
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
A Permutation-Based Pyramid Broadcasting Scheme for Video-on-Demand Systems
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
A unified analysis of hot video schedulers
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Scalability of multicast delivery for non-sequential streaming access
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The dyadic stream merging algorithm
Journal of Algorithms
Delimiting the range of effectiveness of scalable on-demand streaming
Performance Evaluation
An 5-competitive on-line scheduler for merging video streams
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Competitive Analysis of On-line Stream Merging Algorithms
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Improved On-Line Stream Merging: From a Restricted to a General Setting
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
On-line stream merging in a general setting
Theoretical Computer Science - Computing and combinatorics
Resource Requirements of Closed-Loop Video Delivery Services
IEEE MultiMedia
Bandwidth usage distribution of multimedia servers using Patching
Computer Networks: The International Journal of Computer and Telecommunications Networking
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 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) + &Ogr;(1) and logø(1/(2D)) + &Ogr;(1) from the off-line optimal, where n is the number of requests, D is the guaranteed maximum startup delay measured as a fraction of the time for a full stream, and ø = (1 + √5)/2. Empirical studies show that the dynamic Fibonacci tree algorithms perform much better than indicated by the analysis.