Asymptotic independence of servers’ activity in queueing systems with limited resource pooling

被引:0
作者
Virag Shah
Gustavo de Veciana
机构
[1] The University of Texas at Austin,Department of ECE
来源
Queueing Systems | 2016年 / 83卷
关键词
Resource pooling; Server activity; Concentration ; Mean field; Insensitivity; Power; Network capacity; 60K25;
D O I
暂无
中图分类号
学科分类号
摘要
We consider multi-class multi-server queuing systems where a subset of servers, called a server pool, may collaborate in serving jobs of a given class. The pools of servers associated with different classes may overlap, so the sharing of server resources across classes is done via a dynamic allocation policy based on a fairness criterion. We consider an asymptotic regime where the total load increases proportionally with the system size. We show that under limited scaling in size of server pools the stationary distribution for activity of a fixed finite subset of servers has asymptotically a product form, which in turn implies a concentration result for server activity. In particular, we establish a clear connection between the scaling of server pools’ size and asymptotic independence. Further, these results are robust to the service requirement distribution of jobs. For large-scale cloud systems where heterogeneous pools of servers collaborate in serving jobs of diverse classes, a concentration in server activity indicates that the overall power and network capacity that need to be provisioned may be substantially lower than the worst case, thus reducing costs.
引用
收藏
页码:13 / 28
页数:15
相关论文
共 18 条
[1]  
Barroso L(2009)The datacenter as a computer: an introduction to the design of warehouse-scale machines Synth. Lect. Comput. Archit. 4 1-108
[2]  
Hölzle U(2006)A queueing analysis of max-min fairness, proportional fairness and balanced fairness Queueing Syst. 53 65-84
[3]  
Bonald T(2003)Insensitive bandwidth sharing in data networks Queueing Syst. 44 69-100
[4]  
Massoulié L(2012)Asymptotic independence of queues under randomized load balancing Queueing Syst. 71 247-292
[5]  
Proutière A(1973)Canonical representations and convergence criteria for processes with interchangeable increments Zeitschrift fr Wahrscheinlichkeitstheorie und Verwandte Gebiete 27 23-36
[6]  
Virtamo J(1991)Loss networks Ann. Appl. Probab. 1 319-378
[7]  
Bonald T(2007)Structural properties of proportional fairness: stability and insensitivity Ann. Appl. Probab. 17 809-839
[8]  
Proutière A(1996)Queueing system with selection of the shortest of two queues: an asymptotic approach Probl. Peredachi Informatsii 32 20-34
[9]  
Bramson M(1985)Blocking when service is required from several facilities simultaneously AT&T Tech. J. 64 1807-1856
[10]  
Lu Y(undefined)undefined undefined undefined undefined-undefined