Share Email Print
cover

Proceedings Paper

Dynamic allocation and replication techniques for increasing the stream capacity of a media server
Author(s): Divyesh Jadav; Alok Choudhary
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

High performance servers and high speed networks will form the backbone of the infrastructure required for distributed multimedia information systems. A server for an interactive distributed multimedia system may require thousands of gigabytes of storage space and high I/O bandwidth. In order to maximize system utilization, and thus minimize cost, it is essential that the load be balanced among each of the server's components vis. the disks, the interconnection network and the scheduler. Many algorithms for maximizing retrieval capacity from the storage system have been proposed in the literature. This paper presents techniques for improving server capacity by assigning media requests to the noes of a server so as to balance the load on the interconnection network and the scheduling nodes. Five policies for request assignment, round robin, minimum link allocation, minimum contention allocation, weighted minimum link allocation and weighted minimum contention allocation are developed. We also consider the issue of file replication, and develop two schemes for storing the replicas. The performance of these policies on a server model developed earlier is presented.

Paper Details

Date Published: 1 November 1996
PDF: 15 pages
Proc. SPIE 2916, Multimedia Storage and Archiving Systems, (1 November 1996); doi: 10.1117/12.257300
Show Author Affiliations
Divyesh Jadav, Syracuse Univ. (United States)
Alok Choudhary, Northwestern Univ. (United States)


Published in SPIE Proceedings Vol. 2916:
Multimedia Storage and Archiving Systems
C.-C. Jay Kuo, Editor(s)

© SPIE. Terms of Use
Back to Top