Quantitative system performance: computer system analysis using queueing network models
Quantitative system performance: computer system analysis using queueing network models
The Accuracy of the Clock Synchronization Achieved by TEMPO in Berkeley UNIX 4.3BSD
IEEE Transactions on Software Engineering
Distributed Scheduling of Tasks with Deadlines and Resource Requirements
IEEE Transactions on Computers
The greedy load sharing algorithm
Journal of Parallel and Distributed Computing
Design and validation of computer protocols
Design and validation of computer protocols
Concurrent reading and writing of clocks
ACM Transactions on Computer Systems (TOCS)
Adaptive feedback techniques for synchronized multimedia retrieval over integrated networks
IEEE/ACM Transactions on Networking (TON)
Pegasus—operating system support for distributed multimedia systems
ACM SIGOPS Operating Systems Review
Communication architectures and algorithms for media mixing in multimedia conferences
IEEE/ACM Transactions on Networking (TON)
Capacity planning and performance modeling: from mainframes to client-server systems
Capacity planning and performance modeling: from mainframes to client-server systems
A new and improved algorithm for fault-tolerant clock synchronization
Journal of Parallel and Distributed Computing
Storage and synchronization for distributed continuous media
Multimedia Systems
DASD dancing: a disk load balancing optimization scheme for video-on-demand computer systems
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
A synchronization algorithm for distributed multimedia environments
Multimedia Systems
IEEE Transactions on Computers
Balanced job bound analysis of queueing networks
Communications of the ACM
Medusa: an experiment in distributed operating system structure
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
A Coordinated Location Policy for Load Sharing in Hypercube-Connected Multicomputers
IEEE Transactions on Computers
Resource Scheduling In A High-Performance Multimedia Server
IEEE Transactions on Knowledge and Data Engineering
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
Probabilistic Assignment of Movies to Storage Devices in a Video-On-Demand System
NOSSDAV '93 Proceedings of the 4th International Workshop on Network and Operating System Support for Digital Audio and Video
Distributed allocation with pools of servers
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Statistical analysis of simulation output data
ANSS '76 Proceedings of the 4th symposium on Simulation of computer systems
Dynamic scheduling strategies for shared-memory multiprocessors
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Fault-tolerant external clock synchronization
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
A Load Balancing Algorithm Using the Circulation of A Single Message Token
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Hi-index | 0.00 |
Service providers have begun to offer multimedia-on-demand services to residential estates by installing isolated, small-scale multimedia servers at individual estates. Such an arrangement allows the service providers to operate without relying on a high-speed, large-capacity metropolitan area network, which is still not available in many countries. Unfortunately, installing isolated servers could incur very high server costs, as each server requires spare bandwidth to cope with fluctuations in user demand. In this paper, we explore the feasibility of linking up several small multimedia servers to a (limited-capacity) network, and allowing servers with idle retrieval bandwidth to help out servers that are temporarily overloaded; the goal is to minimize the waiting time for service to begin. We identify four characteristics of load sharing in a distributed multimedia system that differentiate it from load balancing in a conventional distributed system. We then introduce a GWQ load sharing algorithm that fits and exploits these characteristics; it puts all servers' pending requests in a global queue, from which a server with idle capacity obtains additional jobs. The performance of the algorithm is captured by an analytical model, which we validate through simulations. Both the analytical and simulation models show that the algorithm vastly reduces wait times at the servers. The analytical model also provides guidelines for capacity planning. Finally, we propose an enhanced GWQ+L algorithm that allows a server to reclaim active local requests that are being serviced remotely. Simulation experiments indicate that the scheduling decisions of GWQ+L are optimal, in the sense that it enables the distributed servers to approximate the performance of a large centralized server.