T. Bonald and C. Comte, Balanced fair resource sharing in computer clusters". Performance Evaluation 116, vol.63, pp.70-83, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01581786

T. Bonald, C. Comte, V. Shah, and G. De-veciana, Poly-symmetry in processor-sharing systems, Queueing Systems, vol.86, p.81, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01513544

T. Bonald, C. Comte, and F. Mathieu, Performance of Balanced Fairness in Resource Pools: A Recursive Approach, Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol.1, issue.2, p.99, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01630420

A. Bouillard, C. Comte, E. De-panafieu, and F. Mathieu, Of Kernels and Queues: When Network Calculus Meets Analytic Combinatorics", 30th International Teletraffic Congress, vol.02, pp.49-54, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01889101

C. Comte, Dynamic Load Balancing with Tokens, 17th International IFIP TC6 Networking Conference, vol.153, p.135, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02340255

C. Comte and F. Mathieu, Kleinberg's grid unchained, Theoretical Computer Science, p.17, 2018.

C. Comte, Dynamic load balancing with tokens, Computer Communications, vol.144, p.135, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02340255

T. Bonald and C. Comte, A Round-Robin Scheduling for Computer Clusters with Compatibility Constraints. Poster presented at RESCOM Summer School, p.119, 2017.

T. Bonald, C. Comte, and F. Mathieu, À la racine du parallélisme, ALGOTEL 2017 -19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, vol.99, p.16, 2017.

T. Bonald, C. Comte, and F. Mathieu, , vol.99, p.16, 2017.

C. Comte and F. Mathieu, La Grille de Kleinberg, l'Univers et le Reste, ALGOTEL 2017 -19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications. Best student paper award, p.17, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01517123

T. Bonald, C. Comte, and F. Mathieu, Un seul serveur vous manque, et tout est découplé !" ALGOTEL 2018 -20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, p.99, 2018.

A. Bouillard, C. Comte, E. De-panafieu, and F. Mathieu, 0 = 0, c'est le truc du noyau ! Application aux files d'attente, ALGOTEL 2019 -21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02118156

C. Comte, Rien ne sert de prédire ; il faut servir ancien, pp.2019-2040

, Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications. Saint Laurent de la Cabrerisse, vol.135, 2019.

, Source code to generate the numerical results

C. Comte, Resource Management in Computer Clusters: Algorithm Design and Performance Analysis. Version v1.0 of the GitHub repository ccomte/phd-thesis, vol.93, p.159, 2019.
URL : https://hal.archives-ouvertes.fr/tel-02413496

F. Mathieu, Of Kernels and Queues: when network calculus meets analytics combinatorics. Version v1.0 of the GitHub repository balouf/kernel and queues, p.17, 0193.

S. Aalto, Beyond Processor Sharing". SIGMETRICS Perform, Eval. Rev, vol.34, pp.36-43, 2007.

I. Adan, C. Hurkens, and G. Weiss, A Reversible Erlang Loss System with Multitype Customers and Multitype Servers, Probability in the Engineering and Informational Sciences, vol.24, issue.4, pp.535-548, 2010.

I. Adan and G. Weiss, A Loss System with Skill-based Servers under Assign to Longest Idle Server Policy, Probability in the Engineering and Informational Sciences, vol.26, issue.3, p.137, 2012.

I. Adan and G. Weiss, A Skill Based Parallel Service System Under FCFS-ALIS -Steady State, Overloads, and Abandonments, Stochastic Systems, vol.4, issue.1, p.77, 2014.

U. Ayesta, T. Bodas, and I. M. Verloop, On a unifying product form framework for redundancy models, Performance Evaluation, vol.127, pp.93-119, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01713937

C. Banderier and P. Flajolet, Basic analytic combinatorics of directed lattice paths

. Theor, Comput. Sci, vol.281, pp.37-80, 2002.

F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios, Open, Closed, and Mixed Networks of Queues with Different Classes of Customers, Journal of the ACM, vol.22, issue.2, p.37, 1975.

M. A. Beck, Advances in Theory and Applicability of Stochastic Network Calculus, p.185, 2016.

S. A. Berezner, C. F. Kriel, and A. E. Krzesinski, Quasi-reversible multiclass queues with order independent departure rates, Queueing Systems, vol.19, p.52, 1995.

S. A. Berezner and A. E. Krzesinski, Order independent loss queues, Queueing Systems, vol.23, pp.331-335, 1996.

D. Bertsekas and R. Gallager, Data networks, p.28, 1987.

T. Bonald, M. Jonckheere, and A. Proutière, Insensitive Load Balancing, Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS '04/Performance '04, pp.367-377, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01284237

T. Bonald, L. Massoulié, A. Proutière, and J. Virtamo, A queueing analysis of max-min fairness, proportional fairness and balanced fairness, Queueing Systems, vol.53, issue.2, pp.65-84, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01244245

T. Bonald and A. Proutière, Insensitivity in processor-sharing networks". Performance Evaluation. Performance, vol.49, p.71, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01267145

T. Bonald and A. Proutière, Insensitive Bandwidth Sharing in Data Networks, Queueing Systems, vol.44, issue.1, pp.69-100, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01267144

T. Bonald and A. Proutière, On performance bounds for balanced fairness, Performance Evaluation. Internet Performance Symposium (IPS 2002), vol.55, pp.25-50, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01276419

T. Bonald and J. Virtamo, Calculating the flow level performance of balanced fairness in tree networks, Performance Evaluation, vol.58, pp.1-14, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01272523

T. Bonald and J. Virtamo, A recursive formula for multirate systems with elastic traffic, IEEE Communications Letters, vol.9, pp.753-755, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01275699

T. Bonald and M. Feuillet, Network Performance Analysis, vol.180, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00726604

T. Bonald, A. Penttinen, and J. Virtamo, On Light and Heavy Traffic Approximations of Balanced Fairness, Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS '06/Performance '06, pp.109-120, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01277612

T. Bonald and A. Proutière, Queueing Networks: A Fundamental Approach, pp.729-765, 2011.

T. Bonald and J. Roberts, Multi-Resource Fairness: Objectives, Algorithms and Performance, Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS '15, pp.31-42, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01243985

M. Van-der-boor, S. Borst, and J. Van-leeuwaarden, Load balancing in large-scale systems with multiple dispatchers, IEEE INFOCOM 2017 -IEEE Conference on Computer Communications, vol.160, pp.162-164, 2017.

M. Van-der-boor, S. C. Borst, J. S. Van-leeuwaarden, and D. Mukherjee, Scalable load balancing in networked systems: A survey of recent advances, 2018.

M. Bousquet-mélou and M. Mishna, Walks with small steps in the quarter plane, Contemp. Math, vol.520, pp.1-40, 2010.

C. Chang, Performance Guarantees in Communication Networks, TNCS, vol.185, 2000.

D. G. Choudhury and T. Perrett, Designing Cluster Schedulers for Internet-Scale Services, Queue, vol.16, issue.1, 2018.

F. Ciucu, A. Burchard, and J. Liebeherr, Scaling properties of statistical end-to-end bounds in the network calculus, IEEE Trans. Inform. Theory, vol.52, issue.6, pp.2300-2312, 2006.

F. Ciucu and F. Poloczek, On multiplexing flows: Does it hurt or not, IEEE Conf. on Comput. Commun., INFOCOM. 2015, pp.1122-1130

J. W. Cohen, The Single Server Queue, 1982.

D. R. Cox, A use of complex probabilities in the theory of stochastic processes, Mathematical Proceedings of the Cambridge Philosophical Society, vol.51, pp.313-319, 1955.

J. Dean and L. A. Barroso, The Tail at Scale, Commun. ACM, vol.56, pp.74-80, 2013.

J. Dean and S. Ghemawat, MapReduce: Simplified Data Processing on Large Clusters, Commun. ACM, vol.51, pp.107-113, 2008.

A. Demers, S. Keshav, and S. Shenker, Analysis and Simulation of a Fair Queueing Algorithm, Symposium Proceedings on Communications Architectures & Protocols. SIGCOMM '89, pp.1-12, 1989.

D. Dubhashi, V. Priebe, and D. Ranjan, Negative Dependence Through the FKG Inequality, BRICS Report Series, vol.3, 1996.

J. Edmonds, ;. Jünger, G. Reinelt, and G. Rinaldi, Combinatorial Optimization -Eureka, You Shrink!: Papers Dedicated to Jack Edmonds 5th International Workshop Aussois, Submodular Functions, Matroids, and Certain Polyhedra, vol.66, p.65, 2001.

A. K. Erlang, Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges, Post Office Electrical Engineer's Journal, vol.10, pp.189-197, 1917.

G. Fayolle, R. Iasnogorodski, and V. Malyshev, Random Walks in the Quarter Plane: Algebraic Methods, Boundary Value Problems, Applications to Queueing Systems and Analytic Combinatorics. 2nd
URL : https://hal.archives-ouvertes.fr/hal-01651919

M. Fidler and A. Rizk, A Guide to the Stochastic Network Calculus, IEEE Commun. Surveys and Tutorials, vol.17, pp.92-105, 2015.

P. Flajolet and F. Guillemin, The formal theory of birth-and-death processes, lattice path combinatorics and continued fractions, Advances in Applied Probability, vol.32, issue.03, pp.750-778, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00073005

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00072739

J. Floquet, R. Combes, and Z. Altman, Hierarchical beamforming: Resource allocation, fairness and flow level performance, Performance Evaluation, vol.127, pp.36-55, 2018.

S. Fujishige, Submodular Functions and Optimization, vol.58, p.65, 2005.

K. Gardner, Modeling and Analyzing Systems withRedundancy, 2017.

K. Gardner, M. Harchol-balter, E. Hyytiä, and R. Righter, Scheduling for efficiency and fairness in systems with redundancy, Performance Evaluation, vol.116, pp.1-25, 2017.

K. Gardner, Queueing with redundant requests: exact analysis, Queueing Systems, vol.83, p.79, 2016.

K. Gardner, Redundancy-d: The Power of d Choices for Redundancy, Operations Research, vol.65, issue.4, pp.14-16, 2017.

I. Grosof, Z. Scully, and M. Harchol-balter, SRPT for Multiserver Systems". SIGMET-RICS Perform, Eval. Rev, vol.46, issue.3, pp.8-9, 2019.

V. Gupta and N. Walton, Load Balancing in the Nondegenerate Slowdown Regime, Operations Research, vol.67, issue.1, pp.281-294, 2019.

M. Harchol-balter, B. Schroeder, N. Bansal, and M. , Size-based Scheduling to Improve Web Performance, ACM Trans. Comput. Syst, vol.21, issue.2, pp.207-233, 2003.

B. Hindman, Mesos: A Platform for Fine-grained Resource Sharing in the Data Center, Proceedings of the 8th USENIX Conference on Networked Systems Design and Implementation. NSDI'11, pp.295-308, 2011.

Y. Jiang and L. Yong, Stochastic Network Calculus, vol.185, 2008.

M. Jonckheere, Insensitive versus efficient dynamic load balancing in networks without blocking, Queueing Systems, vol.54, p.151, 2006.

M. Jonckheere and J. Mairesse, Towards an Erlang formula for multiclass networks, Queueing Systems, vol.66, pp.53-78, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00721654

M. Jonckheere and B. J. Prabhu, Asymptotics of insensitive load balancing and blocking phases, Queueing Systems, vol.88, pp.243-278, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01299605

F. P. Kelly, Networks of queues with customers of different types, Journal of Applied Probability, vol.12, p.13, 1975.

F. P. Kelly, Reversibility and Stochastic Networks, 2011.

F. P. Kelly and J. Walrand, Networks of Quasi-Reversible Nodes, Applied Probability-Computer Science: The Interface, vol.1, pp.3-29, 1982.

D. G. Kendall, Some Problems in the Theory of Queues, Journal of the Royal Statistical Society. Series B (Methodological), vol.13, pp.151-185, 1951.

D. G. Kendall, Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain, The Annals of Mathematical Statistics, vol.24, issue.3, pp.338-354, 1953.

A. Y. Khinchin, The Mathematical theory of stationary queues, Matematicheskii Sbornik, vol.39, pp.73-84, 1932.

J. F. Kingman, The first Erlang century-and the next, Queueing Systems, vol.63, issue.2, p.3, 2009.

J. Kleinberg, The Small-World Phenomenon: An Algorithmic Perspective, 32nd ACM Symposium on Theory of Computing, vol.17, pp.163-170, 2000.

L. Kleinrock, Queueing Systems, vol.1, 1976.

L. Kleinrock, Computer applications, Queueing Systems, vol.2, 1976.

A. E. Krzesinski, Order Independent Queues". Queueing Networks, Dijk. International Series in Operations Research & Management Science 154, pp.85-120, 2011.

K. Lee, Parallel Data Processing with MapReduce: A Survey, SIGMOD Rec, vol.40, pp.11-20, 2012.

J. Leino and J. Virtamo, Insensitive load balancing in data networks, Computer Networks. Selected Papers from the 3rd International Workshop on QoS in Multiservice IP Networks, vol.50, p.151, 2005.

J. Leino and J. Virtamo, Optimal Load Balancing in Insensitive Data Networks". Quality of Service in Multiservice IP Networks. Lecture Notes in Computer Science, pp.313-324, 2004.

J. D. Little, A Proof for the Queuing Formula: L = ?W, Operations Research, vol.9, issue.3, pp.383-387, 1961.

J. D. Little, Little's Law as Viewed on Its 50th Anniversary, Operations Research, vol.59, issue.3, pp.536-549, 2011.

Y. Lu, Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web services". Performance Evaluation. Special Issue: Performance, vol.68, pp.1056-1071, 2011.

L. Massoulié and J. W. Roberts, Bandwidth sharing and admission control for elastic traffic, Telecommunication Systems, vol.15, pp.185-201, 2000.

L. Massoulié, Structural properties of proportional fairness: Stability and insensitivity, The Annals of Applied Probability, vol.17, pp.809-839, 2007.

M. Mitzenmacher, The power of two choices in randomized load balancing, IEEE Transactions on Parallel and Distributed Systems, vol.12, pp.1094-1104, 2001.

M. D. Mitzenmacher, The Power of Two Choices in Randomized Load Balancing, 1996.

J. C. Mogul and J. Wilkes, Nines Are Not Enough: Meaningful Metrics for Clouds, Proceedings of the Workshop on Hot Topics in Operating Systems. HotOS '19, pp.136-141, 2019.

R. Motwani and P. Raghavan, Randomized Algorithms, 1995.

J. Nagle, On Packet Switches with Infinite Storage, IEEE Transactions on Communications, vol.35, pp.435-438, 1987.

P. Nikolaus and J. B. Schmitt, On per-flow delay bounds in tandem queues under (In)dependent arrivals, IFIP Networking Conference, pp.1-9, 2017.

K. Ousterhout, P. Wendell, M. Zaharia, and I. Stoica, Sparrow: Distributed, Low Latency Scheduling, Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles. SOSP '13, pp.69-84, 2013.

V. Pla, J. Virtamo, and J. Martínez-bauset, Optimal robust policies for bandwidth allocation and admission control in wireless networks, Computer Networks, vol.52, pp.3258-3272, 2008.

F. Pollaczek, Über eine Aufgabe der Wahrscheinlichkeitstheorie. I, Mathematische Zeitschrift, vol.32, pp.64-100, 1930.

F. Poloczek and F. Ciucu, Scheduling analysis with martingales, Perform. Eval, vol.79, pp.56-72, 2014.

A. Roy, Inside the Social Network's (Datacenter) Network, Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication. SIGCOMM '15, pp.123-137, 2015.

L. E. Schrage and L. W. Miller, The Queue M/G/1 with the Shortest Remaining Processing Time Discipline, Operations Research, vol.14, issue.4, pp.670-684, 1966.

M. Schwarzkopf, Cluster Scheduling for Data Centers, ACM Queue, vol.15, 2017.

P. Sehier, A. Bouillard, F. Mathieu, and T. Deiß, Transport Network Design for Fron-tHaul". 3rd IEEE Workshop on Next Generation Backhaul/Fronthaul Networks, vol.185, 2017.

R. Serfozo, Introduction to Stochastic Networks. Stochastic Modelling and Applied Probability, 1999.

V. Shah and G. De-veciana, High-Performance Centralized Content Delivery Infrastructure: Models and Asymptotics, IEEE/ACM Transactions on Networking, vol.23, p.93, 2015.

V. Shah, Centralized content delivery infrastructure exploiting resource pools : performance models and asymptotics. The University of Texas at Austin, vol.11, p.93, 2015.

V. Shah, Discussion during his stay as a Postdoctoral Researcher at Microsoft Research-Inria Joint center, p.24, 2017.

V. Shah and G. De-veciana, Impact of fairness and heterogeneity on delays in large-scale centralized content delivery systems, Queueing Systems, vol.83, issue.86, p.93, 2016.

B. Sharma, Modeling and Synthesizing Task Placement Constraints in Google Compute Clusters, Proceedings of the 2Nd ACM Symposium on Cloud Computing. SOCC '11, vol.3, p.11, 2011.

M. Shreedhar and G. Varghese, Efficient Fair Queueing Using Deficit Round Robin, Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. SIGCOMM '95, vol.129, p.122, 1995.

A. Sinclair, CS271 Randomness & Computation, Lecture 13, p.94, 2011.

A. L. Stolyar, Pull-based load distribution in large-scale heterogeneous service systems, Queueing Systems, vol.80, pp.341-361, 2015.

A. L. Stolyar, Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers, Queueing Systems, vol.85, pp.31-65, 2017.

A. Verma, Large-scale Cluster Management at Google with Borg, Proceedings of the Tenth European Conference on Computer Systems. EuroSys '15, vol.18, pp.1-18, 2015.

J. Visschers, I. Adan, and G. Weiss, A product form solution to a system with multi-type jobs and multi-type servers, Queueing Systems, vol.70, issue.3, pp.269-298, 2012.

P. Whittle, Partial balance and insensitivity, Journal of Applied Probability, vol.22, issue.1, pp.168-176, 1985.

P. Whittle, Partial balance, insensitivity and weak coupling, Advances in Applied Probability, vol.18, p.79, 1986.

P. Whittle, Weak coupling in stochastic systems, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences, vol.395, p.60, 1808.

P. Whittle, Systems in Stochastic Equilibrium, vol.21, p.13, 1986.

R. W. Wolff, Poisson Arrivals See Time Averages, Operations Research, vol.30, issue.2, pp.223-231, 1982.

M. Zaharia, Apache Spark: A Unified Engine for Big Data Processing, Commun. ACM, vol.59, pp.56-65, 2016.