ACM Home Page
Please provide us with feedback. Feedback
Fault-tolerant architectures for continuous media servers
Full text PdfPdf (1.41 MB)
Source International Conference on Management of Data archive
Proceedings of the 1996 ACM SIGMOD international conference on Management of data table of contents
Montreal, Quebec, Canada
Pages: 79 - 90  
Year of Publication: 1996
ISBN:0-89791-794-4
Also published in ...
Authors
Banu Özden  Bell Laboratories
Rajeev Rastogi  Bell Laboratories
Prashant Shenoy  University of Texas, Austin
Avi Silberschatz  Bell Laboratories
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 23,   Citation Count: 13
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/233269.233322
What is a DOI?

ABSTRACT

Continuous media servers that provide support for the storage and retrieval of continuous media data (e.g., video, audio) at guaranteed rates are becoming increasingly important. Such servers, typically, rely on several disks to service a large number of clients, and are thus highly susceptible to disk failures. We have developed two fault-tolerant approaches that rely on admission control in order to meet rate guarantees for continuous media requests. The schemes enable data to be retrieved from disks at the required rate even if a certain disk were to fail. For both approaches, we present data placement strategies and admission control algorithms. We also present design techniques for maximizing the number of clients that can be supported by a continuous media server. Finally, through extensive simulations, we demonstrate the effectiveness of our schemes.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

BGM95
CKY93
CLG+94
HG92
 
MH86
Jr. M Hall. Combinatorial Theory. John Wiley &: Sons, 1986.
 
ML90
 
Mou95
Antoine Mourad. Reliable disk striping in videoon-demand servers. In Proceedings of the International Conference on Distributed Multimedia Systems and Applications, stanford, CA, August 1995.
 
ÖRS95
 
ÖRS96
PGK88
 
SG94
TPBG93

CITED BY  13

Collaborative Colleagues:
Banu Özden: colleagues
Rajeev Rastogi: colleagues
Prashant Shenoy: colleagues
Avi Silberschatz: colleagues