Abstract
We consider multiclass queueing systems where the per class service rates depend on the network state, fairness criterion, and is constrained to be in a symmetric polymatroid capacity region. We develop new comparison results leading to explicit bounds on the mean service time under various fairness criteria and possibly heterogeneous loads. We then study large-scale systems with a growing number of service classes n (for example, files), \(m = \left\lceil {bn} \right\rceil \) heterogenous servers with total service rate \(\xi m\), and polymatroid capacity resulting from a random bipartite graph \({\mathcal {G}}^{(n)}\) modeling service availability (for example, placement of files across servers). This models, for example, content delivery systems supporting pooling of server resources, i.e., parallel servicing of a download request from multiple servers. For an appropriate asymptotic regime, we show that the system’s capacity region is uniformly close to a symmetric polymatroid—heterogeneity in servers’ capacity and file placement disappears. Combining our comparison results and the asymptotic ‘symmetry’ in large systems, we show that large randomly configured systems with a logarithmic number of file copies are robust to substantial load and server heterogeneities for a class of fairness criteria. If each class can be served by \(c_n=\omega (\log n)\) servers, the load per class does not exceed \(\theta _n=o\left( \min (\frac{n}{\log n}, c_n)\right) \), mean service requirement of a job is \(\nu \), and average server utilization is bounded by \(\gamma <1\), then for each constant \(\delta >1\), the conditional expectation of delay of a typical job with respect to the \(\sigma \)-algebra generated by \({\mathcal {G}}^{(n)}\) satisfies the following:
Similar content being viewed by others
References
Bonald, T.: Throughput performance in networks with linear capacity contraints. In: Proceedings of CISS, pp. 644 –649 (2006)
Bonald, T., Massoulié, L., Proutière, A., Virtamo, J.: A queueing analysis of max-min fairness, proportional fairness and balanced fairness. Queueing Syst. 53, 65–84 (2006)
Bonald, T., Proutière, A.: Insensitive bandwidth sharing in data networks. Queueing Syst. 44, 69–100 (2003)
Bonald, T., Proutière, A.: On stochastic bounds for monotonic processor sharing networks. Queueing Syst. 47, 81–106 (2004)
Bonald, T., Proutière, A., Roberts, J., Virtamo, J.: Computational aspects of balanced fairness. In: Proceedings of ITC (2003)
Bonald, T., Virtamo, J.: Calculating the flow level performance of balanced fairness in tree networks. Perform. Eval. 58(1), 1–14 (2004)
de Veciana, G., Lee, T.J., Konstantopoulos, T.: Stability and performance analysis of networks supporting elastic services. IEEE/ACM Trans. Netw. 9(1), 2–14 (2001)
Dubhashi, D., Ranjan, D.: Balls and bins: A study in negative dependence. Random Struct. Algorithms 13(2), 99–124 (1998)
Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Proceedings of Calgary International Conference on Combinatorial Structures and Applications, pp. 69–87. Gordon and Breach, New York (1969)
Frank, B., Poese, I., Smaragdakis, G., Feldmann, A., Maggs, B.M., Uhlig, S., Aggarwal, V., Schneider, F.: Collaboration opportunities for content delivery and network infrastructures. In: H. Haddadi, O. Bonaventure (eds.) Recent Advances in Networking, pp. 305–377 (2013)
Joseph, V., de Veciana, G.: Stochastic networks with multipath flow control: Impact of resource pools on flow-level performance and network congestion. In: Proceedings of the ACM Sigmetrics, pp. 61–72 (2011)
Kelly, F.P., Maulloo, A.K., Tan, D.K.H.: Rate control for communication networks: shadow prices, proportional fairness and stability. J. Oper. Res. Soc. 49(3), 237–252 (1998)
Lan, T., Kao, D., Chiang, M., Sabharwal, A.: An axiomatic theory of fairness in network resource allocation. In: Proceedings of IEEE Infocom, pp. 1–9 (2010)
Leconte, M., Lelarge, M., Massoulié, L.: Adaptive replication in distributed content delivery networks. arXiv preprint arXiv:1401.1770 (2014)
Lin, X., Shroff, N.: Utility maximization for communication networks with multipath routing. IEEE Trans. Autom. Control 51(5), 766–781 (2006)
Marshall, A.W., Olkin, I., Arnold, B.C.: Inequalities: Theory of Majorization and Its Applications, 2nd edn. Springer, New York (2011)
Massoulié, L., Roberts, J.: Bandwidth sharing and admission control for elastic traffic. Telecommun. Syst. 15(1–2), 185–201 (2000)
Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)
Mo, J., Walrand, J.: Fair end-to-end window-based congestion control. IEEE/ACM Trans. Netw. 8(5), 556–567 (2000)
Moharir, S., Ghaderi, J., Sanghavi, S., Shakkottai, S.: Serving content with unknown demand: The high-dimensional regime. In: Proceedings of ACM Sigmetrics, pp. 435–447 (2014)
Nemhauser, G.L., Wolsey, L.A.: Integer and combinatorial optimization, vol. 18. Wiley, New York (1988)
Shah, V., de Veciana, G.: Performance evaluation and asymptotics for content delivery networks. In: IEEE Infocom, pp. 2607–2615 (2014)
Shah, V., de Veciana, G.: High performance centralized content delivery infrastructure: models and asymptotics. IEEE/ACM Trans. Netw. 23, 1674 (2015)
Tsitsiklis, J.N., Xu, K.: Flexible queueing architectures. arXiv preprint arXiv:1505.07648 (2015)
Walrand, J.: An Introduction to Queueing Networks. Prentice Hall, Englewood Cliffs (1988)
Yeh, E.: Multiaccess and fading in communication networks. Ph.D. thesis, Massachusetts Institute of Technology (2001)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Shah, V., de Veciana, G. Impact of fairness and heterogeneity on delays in large-scale centralized content delivery systems. Queueing Syst 83, 361–397 (2016). https://doi.org/10.1007/s11134-016-9491-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-016-9491-0