On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Self-similarity in World Wide Web traffic: evidence and possible causes
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Allocating bandwidth for bursty connections
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Charging and accounting for bursty connections
Internet economics
Internet Web servers: workload characterization and performance implications
IEEE/ACM Transactions on Networking (TON)
Resource containers: a new facility for resource management in server systems
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
On multi-dimensional packing problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Cellular Disco: resource management using virtual clusters on shared-memory multiprocessors
Proceedings of the seventeenth ACM symposium on Operating systems principles
Cluster reserves: a mechanism for resource management in cluster-based network servers
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Dynamic Load Balancing on Web-Server Systems
IEEE Internet Computing
Stream-Packing: Resource Allocation in Web Server Farms with a QoS Guarantee
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
Stream-Packing: Resource Allocation in Web Server Farms with a QoS Guarantee
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking
Autonomic resource provisioning in cloud systems with availability goals
Proceedings of the 2013 ACM Cloud and Autonomic Computing Conference
| Hi-index | 0.01 |
Current web server farms have simple resource allocation models. One model used is to dedicate a server or a group of servers for each customer. Another model partitions physical servers into logical servers and assigns one to each customer. Yet another model allows customers to be active on multiple servers using load-balancing techniques. The ability to handle peak loads while minimizing cost of resources required on the farm is a subject of ongoing research.We improve resource utilization through sharing. Customer load is expressed as a multidimensional probability distribution. Each customer is assigned to a server so as to minimize the total number of servers needed to host all the customers. We use the notion of complementarity of customers in simple heuristics for this stochastic vector-packing problem. The proposed method generates a resource allocation plan while guaranteeing a QoS to each customer. Simulation results justify our scheme.