Design of a Video Storage Server that Maximizes Concurrent Streams and Minimizes Initial Latency


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 10, pp. 2608-2617, Oct. 1999
10.3745/KIPSTE.1999.6.10.2608,   PDF Download:

Abstract

One of the most important functionality that commercial video storage servers should provide is to maximize the number of concurrent streams and to minimize the initial latency of new requests. In this paper, we propose a data placement scheme whose disk read unit size can be twice larger than that of conventional striping methods. The proposed scheme can significantly increase the number of concurrent streams, since the ratio of rotational latency time is decreased and the disks are effectively utilized. The disk scheduling scheme we propose guarantees constant initial latency time. We also propose a procedural design method for a storage server by introducing the concept of allowed initial latency. The comparison with previous research shows that the proposed scheme provides better performance.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
M. P. Soo, C. C. Sik, J. Y. Sook, S. G. Sang, "Design of a Video Storage Server that Maximizes Concurrent Streams and Minimizes Initial Latency," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 10, pp. 2608-2617, 1999. DOI: 10.3745/KIPSTE.1999.6.10.2608.

[ACM Style]
Mah Pyeong Soo, Cho Chang Sik, Jin Yun Sook, and Shin Gyu Sang. 1999. Design of a Video Storage Server that Maximizes Concurrent Streams and Minimizes Initial Latency. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 10, (1999), 2608-2617. DOI: 10.3745/KIPSTE.1999.6.10.2608.