Optimal Scheduling of Secondary Content for Aggregation in Video-on-Demand Systems
Little, Thomas D.C.
MetadataShow full item record
CitationBasu, Prithwish; Narayanan, Ashok; Ke, Wang; Little, Tom; Bestavros, Azer. "Optimal Scheduling of Secondary Content for Aggregation in Video-on-Demand Systems", Technical Report BUCS-1999-008, Computer Science Department, Boston University, July 27, 1999. [Available from: http://hdl.handle.net/2144/1785]
Dynamic service aggregation techniques can exploit skewed access popularity patterns to reduce the costs of building interactive VoD systems. These schemes seek to cluster and merge users into single streams by bridging the temporal skew between them, thus improving server and network utilization. Rate adaptation and secondary content insertion are two such schemes. In this paper, we present and evaluate an optimal scheduling algorithm for inserting secondary content in this scenario. The algorithm runs in polynomial time, and is optimal with respect to the total bandwidth usage over the merging interval. We present constraints on content insertion which make the overall QoS of the delivered stream acceptable, and show how our algorithm can satisfy these constraints. We report simulation results which quantify the excellent gains due to content insertion. We discuss dynamic scenarios with user arrivals and interactions, and show that content insertion reduces the channel bandwidth requirement to almost half. We also discuss differentiated service techniques, such as N-VoD and premium no-advertisement service, and show how our algorithm can support these as well.