Chaining: a generalized batching technique for video-on-demand systems

Abstract

Although the bandwidth of the storage I/O typically dictates the performance of a conventional DBMS, network-I/O bandwidth limitation is the main operating constraint of most multimedia database systems. In spite of the fact that the throughput of a public network (e.g. ATM) can be huge, the network-I/O bottleneck limits the number of client stations a media server can support simultaneously. A possible solution to this problem is to batch requests for the same video and multicast the data to these requesters to save the network I/O bandwidth. A disadvantage of this scheme is that it unfairly forces requests arriving early in a batch to wait for the latecomers. As a result, the reneging rate can be high in a system which employs this technique. To reduce the long access latency, we examine in this paper a new batching mechanism called chaining. This approach allows the server to serve a "chain" of client stations using a single data stream. The idea is to pipeline the data stream through the chain of stations. Requests arriving early in a chain (virtual batch), therefore, do not have to experience long delays as in conventional batching. Our simulation results based on an ATM networking environment indicate that very significant performance improvement over batching can be obtained.