Designing file systems for digital video and audio
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Principles of delay-sensitive multimedia data storage retrieval
ACM Transactions on Information Systems (TOIS)
A file system for continuous media
ACM Transactions on Computer Systems (TOCS)
News on-demand for multimedia networks
MULTIMEDIA '93 Proceedings of the first ACM international conference on Multimedia
Streaming RAID: a disk array management system for video files
MULTIMEDIA '93 Proceedings of the first ACM international conference on Multimedia
I/O issues in a multimedia system
Computer
A statistical admission control algorithm for multimedia servers
MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
Issues in multimedia server design
ACM Computing Surveys (CSUR)
Multimedia Systems and Techniques
Multimedia Systems and Techniques
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
Proceedings of the Third International Workshop on Network and Operating System Support for Digital Audio and Video
Algorithms for designing multimedia servers
Computer Communications
A Scalable Video Server Using Intelligent Network Attached Storage
MMNS '02 Proceedings of the 5th IFIP/IEEE International Conference on Management of Multimedia Networks and Services: Management of Multimedia on the Internet
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Providing resource allocation and performance isolation in a shared streaming-media hosting service
Proceedings of the 2004 ACM symposium on Applied computing
Heuristics for Optimizing Multi-Clip Queries in Video Databases
Multimedia Tools and Applications
| Hi-index | 0.00 |
In this paper, we have proposed efficient admission control algorithms for multimedia storage servers that are providers of variable-bit-rate media streams. The proposed schemes are based on a slicing technique and use aggressive methods for admission control. We have developed two types of admission control schemes: Future-Max (FM) and Interval Estimation (IE). The FM algorithm uses the maximum bandwidth requirement of the future to estimate the bandwidth requirement. The IE algorithm defines a class of admission control schemes that use a combination of the maximum and average bandwidths within each interval to estimate the bandwidth requirement of the interval. The performance evaluations done through simulations show that the server utilization is improved by using the FM and IE algorithms. Furthermore, the quality of service is also improved by using the FM and IE algorithms. Several results depicting the trade-off between the implementation complexity, the desired accuracy, the number of accepted requests, and the quality of service are presented.