Competitive algorithms for server problems
Journal of Algorithms
On-line scheduling in the presence of overload
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Dover: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
SIAM Journal on Computing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Combinatorial optimization
Competitive dynamic bandwidth allocation
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Online computation and competitive analysis
Online computation and competitive analysis
Approximating the throughput of multiple machines under real-time scheduling
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A unified approach to approximating resource allocation and scheduling
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Web traffic modeling and Web server performance analysis
ACM SIGMETRICS Performance Evaluation Review
Bandwidth Allocation with Preemption
SIAM Journal on Computing
Algorithms for Minimizing Response Time in Broadcast Scheduling
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
On admission control for profit maximization of networked service providers
WWW '03 Proceedings of the 12th international conference on World Wide Web
Allocating servers in infostations for bounded simultaneous requests
Journal of Parallel and Distributed Computing
QoSMig: Adaptive Rate-Controlled Migration of Bulk Data in Storage Systems
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
On Honey Bees and Dynamic Server Allocation in Internet Hosting Centers
Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems
Online optimization for the smart (micro) grid
Proceedings of the 3rd International Conference on Future Energy Systems: Where Energy, Computing and Communication Meet
| Hi-index | 0.00 |
A web content hosting service provider needs to dynamically allocate servers in a server farm to its customers' web sites. Ideally, the allocation to a site should always suffice to handle its load. However, due to a limited number of servers and the overhead incurred in changing the allocation of a server from one site to another, the system may become overloaded. The problem faced by the web hosting service provider is how to allocate the available servers in the most profitable way. Adding to the complexity of this problem is the fact that future loads of the sites are either unknown or known only for the very near future.In this paper we model this server allocation problem, and consider both its offline and online versions. We give a polynomial time algorithm for computing the optimal offline allocation. In the online setting, we show almost optimal algorithms (both deterministic and randomized) for any positive lookahead. The quality of the solution improves as the lookahead increases. We also consider several special cases of practical interest. Finally, we present some experimental results using actual trace data that show that one of our online algorithm performs very close to optimal.Interestingly, the online server allocation problem can be cast as a more general benefit task system that we define. Our results extend to this task system, which captures also the benefit maximization variants of the k-server problem and the metrical task system problem. It follows that the benefit maximization variants of these problems are more tractable than their cost minimization variants.