Dynamic Active Window Management: A Method for Improving Revenue Generation in Dynamic Enterprise Systems

In dynamic resource allocation systems, servers are moved between pools when overloading is detected. In this work, we investigate the impact to such systems of combining three adaptive monitoring techniques. First we employ two well known switching policies -- the Proportional Switching Policy (PSP) and the Bottleneck Aware Switching Policy (BSP) -- to move servers between server pools as appropriate. Second we use a meta-forecasting technique to predict the movement in future system workload. Third, we use a Dynamic Active Window Model (DAWM), which defines the period over which workload data is analysed. We have previously shown that request servicing capability can be improved by as much as 40\% when the right combination of dynamic server switching and workload forecasting are used. This extended model shows that a further 51.5\% improvement can be achieved when the switching server policy, meta-forecasting and dynamic active window management are employed together over a real-world workload based on Internet traces.

[1]  Mon-Yen Luo,et al.  Realizing Fault Resilience in Web-Server Cluster , 2000, ACM/IEEE SC 2000 Conference (SC'00).

[2]  Carlos Juiz,et al.  Analysis of burstiness monitoring and detection in an adaptive Web system , 2009, Comput. Networks.

[3]  Stephen A. Jarvis,et al.  Dynamic Resource Allocation in Enterprise Systems , 2008, 2008 14th IEEE International Conference on Parallel and Distributed Systems.

[4]  Prashant J. Shenoy,et al.  Dynamic Provisioning of Multi-tier Internet Applications , 2005, Second International Conference on Autonomic Computing (ICAC'05).

[5]  Faraz Ahmad,et al.  Joint optimization of idle and cooling power in data centers while maintaining response time , 2010, ASPLOS 2010.

[6]  Martin F. Arlitt,et al.  Web server workload characterization: the search for invariants , 1996, SIGMETRICS '96.

[7]  Jon Crowcroft,et al.  Analysis of burstiness and jitter in real-time communications , 1993, SIGCOMM 1993.

[8]  Stephen A. Jarvis,et al.  Dynamic Resource Allocation and Active Predictive Models for Enterprise Applications , 2011, CLOSER.

[9]  J. Little.  A Proof for the Queuing Formula: L = λW , 1961 .

[10]  T. N. Vijaykumar,et al.  Joint optimization of idle and cooling power in data centers while maintaining response time , 2010, ASPLOS XV.

[11]  Xiaoyun Zhu,et al.  Statistical service assurances for applications in utility grid environments , 2004, Perform. Evaluation.

[12]  Giuseppe Serazzi,et al.  Bottlenecks identification in multiclass queueing networks using convex polytopes , 2004, The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings..

[13]  Raffaela Mirandola,et al.  Performance Prediction of Web Service Workflows , 2007, QoSA.

[14]  Stephen S. Lavenberg,et al.  Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.

[15]  Carlos Juiz,et al.  Comparison of predictive techniques in cluster-based network servers with resource allocation , 2004, The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings..

[16]  Stephen A. Jarvis,et al.  A System for Dynamic Server Allocation in Application Server Clusters , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications.

[17]  Virgílio A. F. Almeida,et al.  Capacity Planning for Web Services: Metrics, Models, and Methods , 2001 .

[18]  Xiaodong Wang,et al.  Hierarchical Forecasting of Web Server Workload Using Sequential Monte Carlo Training , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[19]  Marin Litoiu,et al.  A performance analysis method for autonomic computing systems , 2007, TAAS.