Dynamic placement for clustered web applications

We introduce and evaluate a middleware clustering technology capable of allocating resources to web applications through dynamic application instance placement. We define application instance placement as the problem of placing application instances on a given set of server machines to adjust the amount of resources available to applications in response to varying resource demands of application clusters. The objective is to maximize the amount of demand that may be satisfied using a configured placement. To limit the disturbance to the system caused by starting and stopping application instances, the placement algorithm attempts to minimize the number of placement changes. It also strives to keep resource utilization balanced across all server machines. Two types of resources are managed, one load-dependent and one load-independent. When putting the chosen placement in effect our controller schedules placement changes in a manner that limits the disruption to the system.

[1]  C. Gini Variabilita e Mutabilita. , 1913 .

[2]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[3]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[4]  Dimitrios N. Serpanos,et al.  MMPacking: A load and storage balancing algorithm for distributed multimedia servers , 1996, Proceedings International Conference on Computer Design. VLSI in Computers and Processors.

[5]  Philip S. Yu,et al.  Disk load balancing for video-on-demand systems , 1997, Multimedia Systems.

[6]  Willy Zwaenepoel,et al.  Cluster reserves: a mechanism for resource management in cluster-based network servers , 2000, SIGMETRICS '00.

[7]  Quinn Snell,et al.  Application placement using performance surfaces , 2000, Proceedings the Ninth International Symposium on High-Performance Distributed Computing.

[8]  Benny Rochwerger,et al.  Oceano-SLA based management of a computing utility , 2001, 2001 IEEE/IFIP International Symposium on Integrated Network Management Proceedings. Integrated Network Management VII. Integrated Management Strategies for the New Millennium (Cat. No.01EX470).

[9]  Hadas Shachnai,et al.  On Two Class-Constrained Versions of the Multiple Knapsack Problem , 2001, Algorithmica.

[10]  Philip S. Yu,et al.  On balancing the load in a clustered web farm , 2001, TOIT.

[11]  Jussi Kangasharju,et al.  Object replication strategies in content distribution networks , 2002, Comput. Commun..

[12]  Prashant J. Shenoy,et al.  Resource overbooking and application profiling in shared hosting platforms , 2002, OSDI '02.

[13]  HarrisTim,et al.  Xen and the art of virtualization , 2003 .

[14]  Abhishek Chandra,et al.  Quantifying the Benefits of Resource Multiplexing in On-Demand Data Centers , 2003 .

[15]  Sven Buchholz,et al.  Replica placement in adaptive content distribution networks , 2004, SAC '04.

[16]  Danilo Ardagna,et al.  SLA based profit optimization in autonomic computing systems , 2004, ICSOC '04.

[17]  Asser N. Tantawi,et al.  Performance management for cluster-based web services , 2005, IEEE Journal on Selected Areas in Communications.

[18]  Asser N. Tantawi,et al.  Dynamic Application Placement Under Service and Memory Constraints , 2005, WEA.

[19]  G. Pacifici,et al.  Managing the Response Time for Multi-tiered Web Applications , 2005 .

[20]  Danilo Ardagna,et al.  SLA Based Profit Optimization in Multi-tier Systems , 2005, Fourth IEEE International Symposium on Network Computing and Applications.