This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dynamic Buffer Allocation in Video-on-Demand Systems
November/December 2003 (vol. 15 no. 6)
pp. 1535-1551
Il-Yeol Song, IEEE Computer Society

Abstract—In video-on-demand (VOD) systems, as the size of the buffer allocated to user requests increases, initial latency and memory requirements increase. Hence, the buffer size must be minimized. The existing static buffer allocation scheme, however, determines the buffer size based on the assumption that the system is in the fully loaded state. Thus, when the system is in a partially loaded state, the scheme allocates a buffer larger than necessary to a user request. This paper proposes a dynamic buffer allocation scheme that allocates to user requests buffers of the minimum size in a partially loaded state, as well as in the fully loaded state. The inherent difficulty in determining the buffer size in the dynamic buffer allocation scheme is that the size of the buffer currently being allocated is dependent on the number of and the sizes of the buffers to be allocated in the next service period. We solve this problem by the predict-and-enforce strategy, where we predict the number and the sizes of future buffers based on inertia assumptions and enforce these assumptions at runtime. Any violation of these assumptions is resolved by deferring service to the violating new user request until the assumptions are satisfied. Since the size of the current buffer is dependent on the sizes of the future buffers, it is represented by a recurrence equation. We provide a solution to this equation, which can be computed at the system initialization time for runtime efficiency. We have performed extensive analysis and simulation. The results show that the dynamic buffer allocation scheme reduces initial latency (averaged over the number of user requests in service from one to the maximum capacity) to {\frac{1}{29.4}} \sim {\frac{1}{11.0}} of that for the static one and, by reducing the memory requirement, increases the number of concurrent user requests to 2.36 \sim 3.25 times that of the static one when averaged over the amount of system memory available. These results demonstrate that the dynamic buffer allocation scheme significantly improves the performance and capacity of VOD systems.

[1] E. Chang and H. Garcia-Molina, Bubbleup: Low Latency Fast-Scan for Media Servers Proc. Fifth ACM Int'l Conf. Multimedia, pp. 87-98, 1997.
[2] S. Berson, S. Ghandeharizadeh, R.R. Muntz, and X. Ju, “Staggered Striping in Multimedia Information Systems,” Proc. SIGMOD, 1994.
[3] J.K. Dey-Sircar, J.D. Salehi, J.F. Kurose, and D. Towsley, Providing Vcr Capabilities in Large-Scale Video Servers Proc. Second ACM Int'l Conf. Multimedia, pp. 25-32, 1994.
[4] A. Dan, D. Sitaram, and P. Shahabuddin, Scheduling Policies for an On-Demand Video Server with Batching Proc. Second ACM Int'l Conf. Multimedia, pp. 15-23, 1994.
[5] E. Chang and H. Garcia-Molina, Effective Memory Use in a Media Server Proc. 23rd Int'l Conf. Very Large Data Bases, pp. 496-505, 1997.
[6] P.S. Yu, M.-S. Chen, and D.D. Kandlur, Grouped Sweeping Scheduling for Data-Based Multimedia Storage Management ACM Multimedia Systems J., vol. 1, no. 1, pp. 99-109, 1993.
[7] L. Goluchik, J.C.S. Lui, and R.R. Muntz, Adaptive Piggybacking: A Novel Techniques for Data Sharing in Video-on-Demand Storage Servers ACM Multimedia Systems J., vol. 4, no. 3, pp. 140-155, 1996.
[8] E. Chang and H. Garcia-Molina, Accounting for Memory Use, Cost, Throughput, and Latency in the Design of a Media Server Technical Report SIDL-WP-1998-0096, Stanford Univ., available fromhttp://www-db.stanford.edu/pub/papersjvld98.ps , 1998.
[9] T.-P.J. To and B. Hamidzadeh, Dynamic Real-Time Scheduling Strategies for Interactive Continuous Media Servers ACM Multimedia Systems J., vol. 7, no. 2, pp. 91-106, 1999.
[10] E. Chang and H. Garcia-Molina, Cost-Based Media Server Design Proc. Eighth Int'l Workshop Research Issues in Data Eng., pp. 76-83, 1998.
[11] D.J. Makaroff and R.T. Ng, Schemes for Implementing Buffer Sharing in Continuous-Media Systems Information Systems, vol. 20, no. 6, pp. 445-465, 1995.
[12] C. Ruemmler and J. Wilkes, "An Introduction to Disk Drive Modeling," Computer, vol. 27, no. 3, pp. 17-28, Mar. 1994.
[13] S.-H. Lee, K.-Y. Whang, Y.-S. Moon, and I.-Y. Song, Dybase: A Buffer Allocation Scheme for Reducing Average Initial Latency in Video-on-Demand Systems Information Sciences, vol. 137, nos. 1-4, pp. 17-31, 2001.
[14] Seagate Barracuda 9LP Family Product Specification, Seagate, Inc., available fromhttp:/www.seagate.com, 1998.
[15] J.L. Wolf, P.S. Yu, and H. Shachnai, Disk Load Balancing for Video-on-Demand Systems ACM Multimedia Systems J., vol. 5, no. 6, pp. 358-370, 1997.
[16] S. Lee, K. Whang, Y. Moon, and I. Song, Dynamic Buffer Allocation in Video-on-Demand Systems Proc. 2001 ACM SIGMOD Int'l Conf. Management of Data, pp. 345-354, 2001.

Index Terms:
VOD systems, dynamic buffer allocation, multimedia systems, buffer scheduling methods.
Citation:
Sang-Ho Lee, Kyu-Young Whang, Yang-Sae Moon, Wook-Shin Han, Il-Yeol Song, "Dynamic Buffer Allocation in Video-on-Demand Systems," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 6, pp. 1535-1551, Nov.-Dec. 2003, doi:10.1109/TKDE.2003.1245291
Usage of this product signifies your acceptance of the Terms of Use.