Staggered striping in multimedia information systems
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Scheduling policies for an on-demand video server with batching
MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
Channel allocation under batching and VCR control in video-on-demand systems
Journal of Parallel and Distributed Computing - Special issue on multimedia processing and technology
Reducing I/O demand in video-on-demand storage servers
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
On configuring a single disk continuous media server
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
The SPIFFI scalable video-on-demand system
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Fault tolerant design of multimedia servers
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
An online video placement policy based on bandwidth to space ratio (BSR)
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Maximizing Buffer and Disk Utilizations for News On-Demand
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Buffering and caching in large-scale video servers
COMPCON '95 Proceedings of the 40th IEEE Computer Society International Conference
On Optimal Batching Policies for Video-on-Demand Storage Servers
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
Buffer Management For Continuous Media Sharing In Multimedia Databse Systems
Buffer Management For Continuous Media Sharing In Multimedia Databse Systems
The trials and travails of interactive TV
IEEE Spectrum
Architectural considerations for next generation file systems
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Multicast Video-on-Demand services
ACM SIGCOMM Computer Communication Review
Dynamic Skyscraper Broadcasts for Video-on-Demand
MIS '98 Proceedings of the 4th International Workshop on Advances in Multimedia Information Systems
Architectural considerations for next-generation file systems
Multimedia Systems
A Simulation-Based Analysis of Scheduling Policies for Multimedia Servers
ANSS '03 Proceedings of the 36th annual symposium on Simulation
An Integrated Resource Sharing Policy for Multimedia Storage Servers Based on Network-Attached Disks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Multicast protocols for scalable on-demand download
Performance Evaluation
Towards scalable delivery of video streams to heterogeneous receivers
MULTIMEDIA '06 Proceedings of the 14th annual ACM international conference on Multimedia
Analysis of waiting-time predictability in scalable media streaming
Proceedings of the 15th international conference on Multimedia
Waiting-time prediction in scalable on-demand video streaming
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Efficient delivery of on-demand video streams to heterogeneous receivers
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Journal on Image and Video Processing - Special issue on selected papers from multimedia modeling conference 2009
Hi-index | 0.00 |
One of the open questions in the design of multimedia storage servers is in what order to serve incoming requests. Given the capability provided by the disk layout and scheduling algorithms to serve multiple streams simultaneously, improved request scheduling algorithms can reduce customer waiting times. This results in better service and/or lower customer loss. In this paper we define a new class of request scheduling algorithms, called Group-Guaranteed Server Capacity (GGSC), that preassign server channel capacity to groups of objects. We also define a particular formal method for computing the assigned capacities to achieve a given performance objective. We observe that the FCFS policy can provide the precise time of service to incoming customer requests. Under this assumption, we compare the performance of one of the new GGSC algorithms, GGSCW-FCFS, against FCFS and against two other recently proposed scheduling algorithms: Maximum Factored Queue length (MFQ), and the FCFS-n algorithm that preassigns capacity only to each of the n most popular objects. The algorithms are compared for both competitive market and captured audience environments.Key findings of the algorithm comparisons are that: (1) FCFS-n has no advantage over FCFS if FCFS gives time of service guarantees to arriving customers, (2) FCFS and GGSCW-FCFS are superior to MFQ for both competitive and captive audience environments, (3) for competitive servers that are configured for customer loss less than 10%, FCFS is superior to all other algorithms examined in this paper, and (4) for captive audience environments that have objects with variable playback length, GGSCW-FCFS is the most promising of the policies considered in this paper. The conclusions for FCFS-n and MFQ differ from previous work because we focus on competitive environments with customer loss under 10%, we assume FCFS can provide time of service guarantees to all arriving customers, and we consider the distribution of customer waiting time as well as the average waiting time.