ZipfAllocation: an algorithm for static allocation of movies in a cluster of video servers
Version of Record online: 25 NOV 2010
Copyright © 2010 John Wiley & Sons, Ltd.
Software: Practice and Experience
Volume 41, Issue 6, pages 695–716, May 2011
How to Cite
Kim, S., Song, H. and Han, S. (2011), ZipfAllocation: an algorithm for static allocation of movies in a cluster of video servers. Softw: Pract. Exper., 41: 695–716. doi: 10.1002/spe.1027
- Issue online: 6 APR 2011
- Version of Record online: 25 NOV 2010
- Manuscript Accepted: 22 SEP 2010
- Manuscript Revised: 5 SEP 2010
- Manuscript Received: 17 OCT 2009
- video server;
- parallel processing;
- allocation algorithm
When a single video server provides a streaming service, there are many limitations. Thus, clusters of multiple video servers are widely used today to provide better service. How movies are allocated to each server in a cluster is an important and ongoing research topic because the movies are large, and there are so many of them. We have developed a movie allocation algorithm based on the observation that client accesses follow a Zipf distribution. We have developed an algorithm in which servers use their storage to their full capacities, movies are assigned to servers as evenly as possible, servers receive requests as evenly as possible, and all movies are allocated to at least one server. Copyright © 2010 John Wiley & Sons, Ltd.