Agile Dynamic Provisioning of Multi-Tier Internet Applications

被引:245
作者
Urgaonkar, Bhuvan [1 ]
Shenoy, Prashant [2 ]
Chandra, Abhishek [3 ]
Goyal, Pawan
Wood, Timothy
机构
[1] Penn State Univ, Dept CSE, University Pk, PA 16802 USA
[2] Univ Massachusetts, Dept Comp Sci, Amherst, MA 01003 USA
[3] Univ Minnesota, Dept CSE, Minneapolis, MN 55455 USA
关键词
Design; Experimentation; Performance; Internet application; dynamic provisioning;
D O I
10.1145/1342171.1342172
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Dynamic capacity provisioning is a useful technique for handling the multi-time-scale variations seen in Internet workloads. In this article, we propose a novel dynamic provisioning technique for multi-tier Internet applications that employs (1) a flexible queuing model to determine how much of the resources to allocate to each tier of the application, and (2) a combination of predictive and reactive methods that determine when to provision these resources, both at large and small time scales. We propose a novel data center architecture based on virtual machine monitors to reduce provisioning overheads. Our experiments on a forty-machine Xen/Linux-based hosting platform demonstrate the responsiveness of our technique in handling dynamic workloads. In one scenario where a flash crowd caused the workload of a three-tier application to double, our technique was able to double the application capacity within five minutes, thus maintaining response-time targets. Our technique also reduced the overhead of switching servers across applications from several minutes to less than a second, while meeting the performance targets of residual sessions.
引用
收藏
页数:39
相关论文
共 52 条
[1]  
ABDELZAHER T, 1999, P WORLD WID WEB C WW
[2]   Performance guarantees for Web server end-systems: A control-theoretical approach [J].
Abdelzaher, TF ;
Shin, KG ;
Bhatti, N .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2002, 13 (01) :80-96
[3]  
*AMAZON, 2000, HOL SHOPP SEAS SO FA
[4]  
[Anonymous], HPL199935R1
[5]  
[Anonymous], P 11 INT WORKSH QUAL
[6]  
[Anonymous], WORKSH PERF QOS NEXT
[7]  
[Anonymous], P USENIX ANN TECHN C
[8]  
[Anonymous], 1996, P 5 INT WORLD WID WE
[9]  
[Anonymous], IEEE COMPUT
[10]  
APPLEBY K, 2001, P IFIP IEEE S INT NE