Andrews, Matthew, Awerbuch, Baruch, Fernández, Antonio, Leighton, Tom, Liu, Zhiyong, and Kleinberg, Jon (2001). Universal-stability results and performance bounds for greedy contention-resolution protocols. Journal of the ACM 48, 39–69. MR1867275, Crossref (Cit. on p. 192)Google Scholar

Asmussen, Søren (2003). Applied Probability and Queues. Second Edition. Vol. 51. Applications of Mathematics. Stochastic Modelling and Applied Probability. Springer-Verlag, New York, NY. MR1978607, Crossref (Cit. on pp. 106, 130, 358, 362)Google Scholar

Asmussen, Søren and Koole, Ger (1993). Marked point processes as limits of Markovian arrival streams. Journal of Applied Probability 30, 365–372. MR1212668, Crossref (Cit. on pp. 362, 366)Google Scholar

Baskett, Forest, Chandy, K. Mani, Muntz, Richard R., and Palacios, Fernando G. (1975). Open, closed, and mixed networks of queues with different classes of customers. Journal of the Association for Computing Machinery 22, 248–260. MR365749, Crossref (Cit. on pp. 53, 77, 106)Google Scholar

Berman, Abraham and Plemmons, Robert J. (1994). Nonnegative Matrices in the Mathematical Sciences. Vol. 9. Classics in Applied Mathematics. Revised reprint of the 1979 original. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA. MR1298430, Crossref (Cit. on p. 217)Google Scholar

Bertsekas, Dimitris and Gallager, Robert G. (1992). Data Networks. Prentice Hall, Englewood Cliffs, NJ. Crossref (Cit. on p. 106)Google Scholar

Bertsimas, Dimitris, Gamarnik, David, and Tsitsiklis, John N. (1996). Stability conditions for multiclass fluid queueing networks. IEEE Transactions on Automatic Control 41, 1618–1631; correction: 42, 128, 1997. MR1419686, Crossref (Cit. on p. 193)Google Scholar

Bertsimas, Dimitris and John, Tsitsiklis (1997). Introduction to Linear Optimization. Vol. 6. Athena Scientific Series in Optimization and Neural Computation. Athena Scientific, Nashua, NH. Crossref (Cit. on p. 196)Google Scholar

Billingsley, Patrick (1999). Convergence of Probability Measures. Second Edition. Wiley, New York, NY. MR1700749, Crossref (Cit. on p. 147)Google Scholar

Borodin, Allan, Kleinberg, Jon, Raghavan, Prabhakar, Sudan, Madhu, and Williamson, David P. (2001). Adversarial queuing theory. Journal of the ACM 48, 13–38. MR1867274, Crossref (Cit. on p. 192)Google Scholar

Borovkov, A. A. (1986). Limit theorems for queueing networks. Theory of Probability and Its Applications 31, 413–427. MR0866868, Crossref (Cit. on p. 78)Google Scholar

Botvich, D. D. and Zamyatin, A. A. (1994). Ergodicity of a conservative communications network. Discrete Mathematics and Applications 4, 479–493. MR1310907, Crossref (Cit. on p. 192)Google Scholar

Bramson, Maury (1994). Instability of FIFO queueing networks. The Annals of Applied Probability 4, 414–431. MR1272733, Crossref (Cit. on pp. 28, 159)Google Scholar

Bramson, Maury (1996a). Convergence to equilibria for fluid models of FIFO queueing networks. Queueing Systems. Theory and Applications 22, 5–45. MR1393404, Crossref (Cit. on pp. xvii, 159)Google Scholar

Bramson, Maury (1996b). Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networks. Queueing Systems. Theory and Applications 23, 1–26. MR1433762, Crossref (Cit. on pp. 106, 250)Google Scholar

Bramson, Maury (1998). Stability of two families of queueing networks and a discussion of fluid limits. Queueing Systems. Theory and Applications 28, 7–31. MR1628469, Crossref (Cit. on pp. 145, 146, 192, 193)Google Scholar

Bramson, Maury (2008). Stability of Queueing Networks. Vol. 1950. Lecture Notes in Mathematics. Lectures from the 36th Probability Summer School Held in Saint-Flour, July 2–15, 2006. Springer, Berlin, Germany. MR2445100, Crossref (Cit. on pp. xvii, 77, 145, 146)Google Scholar

Bramson, Maury, Bernardo, D’Auria, and Neil, Walton (2017). Proportional switching in first-in, first-out networks. Operations Research 65, 496–513. MR3647853, Crossref (Cit. on pp. 192, 310)Google Scholar

Bramson, Maury. and Williams, R. J. (2003). Two workload properties for Brownian networks. Queueing Systems. Theory and Applications 45, 191–221. MR2024178, Crossref (Cit. on p. 53)Google Scholar

Chen, Hong (1995). Fluid approximations and stability of multiclass queueing networks: work-conserving disciplines. The Annals of Applied Probability 5, 637–665. MR1359823, Crossref (Cit. on pp. 145, 146, 193)Google Scholar

Chen, Hong and Mandelbaum, Avi (1991). Discrete flow networks: bottleneck analysis and fluid approximations. Mathematics of Operations Research 16, 408–446. MR1106809, Crossref (Cit. on p. 146)Google Scholar

Chen, Hong and Zhang, Hanqin (1997). Stability of multiclass queueing networks under FIFO service discipline. Mathematics of Operations Research 22, 691–725. MR1467392, Crossref (Cit. on p. 159)Google Scholar

Chen, Hong and Zhang, Hanqin (2000). Stability of multiclass queueing networks under priority service disciplines. Operations Research 48, 26–37. MR1753222, Crossref (Cit. on p. 192)Google Scholar

Chung, Kai Lai (2001). A Course in Probability Theory. Third Edition. Academic Press, Inc., San Diego, CA. MR1796326, Crossref (Cit. on pp. 320, 321, 368)Google Scholar

Cover, Thomas M. and Thomas, Joy A. (2006). Elements of Information Theory. Second Edition. Wiley-Interscience [John Wiley & Sons], Hoboken, NJ. MR2239987, Crossref (Cit. on p. 326)Google Scholar

Cruz, Rene L. (1991). A calculus for network delay, Part II: Network analysis. IEEE Transactions on Information Theory 37, 132–141. MR1087891, Crossref (Cit. on p. 192)Google Scholar

Dai, J. G. (1995a). On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. The Annals of Applied Probability 5, 49–77. MR1325041, Crossref (Cit. on pp. 77, 78, 145, 146, 147, 159, 192, 315)Google Scholar

Dai, J. G. (1995b). Stability of open multiclass queueing networks via fluid models. Stochastic Networks. Ed. by F. Kelly and R. J. Williams. Vol. 71. The IMA Volumes in Mathematics and Its Applications. Springer, New York, NY, 71–90. MR1381005, Crossref (Cit. on p. 192)Google Scholar

Dai, J. G. (1996). A fluid limit model criterion for instability of multiclass queueing networks. The Annals of Applied Probability 6, 751–757. MR1410113, Crossref (Cit. on p. 146)Google Scholar

Dai, J. G., Hasenbein, J. J., and Vate, J. H. Vande (1999). Stability of a three-station fluid network. Queueing Systems. Theory and Applications 33, 293–325. MR1742573, Crossref (Cit. on p. 193)Google Scholar

Dai, J. G. and Lin, Wuqin (2005). Maximum pressure policies in stochastic processing networks. Operations Research 53, 197–218. MR2131925, Crossref (Cit. on pp. 53, 123, 218)Google Scholar

Dai, J. G. and Meyn, Sean P. (1995). Stability and convergence of moments for multiclass queueing networks via fluid limit models. IEEE Transactions on Automatic Control 40, 1889–1904. MR1358006, Crossref (Cit. on p. 146)Google Scholar

Dai, J. G. and Prabhakar, B. (2000). The throughput of data switches with and without speedup. IEEE INFOCOM 2000, Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, 556–564. Crossref (Cit. on p. 309)Google Scholar

Dai, J. G. and Vate, J. H. Vande (2000). The stability of two-station multitype fluid networks. Operations Research 48, 721–744. MR1792776, Crossref (Cit. on pp. 184, 190, 192, 193)Google Scholar

Dai, J. G. and Wang, Y. (1993). Nonexistence of Brownian models for certain multiclass queueing networks. Queueing Systems. Theory and Applications 13, 41–46. MR1218843, Crossref (Cit. on p. 28)Google Scholar

Dai, J. G. and Weiss, G. (1996). Stability and instability of fluid models for reentrant lines. Mathematics of Operations Research 21, 115–134. MR1385870, Crossref (Cit. on p. 192)Google Scholar

Dantzig, George B. (1998). Linear Programming and Extensions. Corrected Edition. Princeton Landmarks in Mathematics. Princeton University Press, Princeton, NJ. MR1658673, Crossref (Cit. on p. 4)Google Scholar

Davis, M. H. A. (1984). Piecewise-deterministic Markov processes: a general class of nondiffusion stochastic models. Journal of the Royal Statistical Society. Series B. 46, 353–388. MR0790622, Crossref (Cit. on p. 76)Google Scholar

De Veciana, G., Lee, Tae-Jin, and Konstantopoulos, T. (2001). Stability and performance analysis of networks supporting elastic services. IEEE/ACM Transactions on Networking 9, 2–14. Crossref (Cit. on p. 250)Google Scholar

Dean, Jeffrey and Ghemawat, Sanjay (2008). MapReduce: simplified data processing on large clusters. Communications of the ACM 51, 107–113. Crossref (Cit. on p. 267)Google Scholar

Down, D. and Meyn, S. P. (1994). Piecewise linear test functions for stability of queueing networks. Proceedings of 1994 33rd IEEE Conference on Decision and Control. Vol. 3, 2069–2074. Crossref (Cit. on p. 192)Google Scholar

Dupuis, Paul and Williams, Ruth J. (1994). Lyapunov functions for semi-martingale reflecting Brownian motions. The Annals of Probability 22, 680–702. MR1288127, Crossref (Cit. on p. 146)Google Scholar

Ethier, Stewart N. and Kurtz, Thomas G. (1986). Markov Processes: Characterization and Convergence. Wiley Series in Probability and Mathematical Statistics. John Wiley & Sons, Inc., New York, NY. MR838085, Crossref (Cit. on pp. 147, 313)Google Scholar

Feller, William (1971). An Introduction to Probability Theory and Its Applications. Vol. II. Second Edition. John Wiley & Sons, Inc., New York–London–Sydney. MR0270403, Crossref (Cit. on p. 307)Google Scholar

Fitzpatrick, Patrick M. and Hunt, Brian R. (2015). Absolute continuity of a function and uniform integrability of its divided differences. American Mathematical Monthly 122, 362–366. MR3343072, Crossref (Cit. on p. 311)Google Scholar

Foss, Serguei G. (1991). Ergodicity of queuing networks. Siberian Mathematical Journal 32, 690–705. Crossref (Cit. on p. 78)Google Scholar

Foss, Serguei G. and Konstantopoulos, Takis (2004). An overview of some stochastic stability methods. Journal of the Operations Research Society of Japan 47, 275–303. MR2174067, Crossref (Cit. on p. 342)CrossRefGoogle Scholar

Foss, Serguei G. and Kovalevskii, Artyom (1999). A stability criterion via fluid limits and its application to a polling system. Queueing Systems. Theory and Applications 32, 131–168. MR1720552, Crossref (Cit. on p. 147)Google Scholar

Gale, David (1960). The Theory of Linear Economic Models. McGraw-Hill Book Co., Inc., New York–Toronto–London. MR0115801, Crossref (Cit. on p. 217)Google Scholar

Gamarnik, David (2000). Using fluid models to prove stability of adversarial queueing networks. IEEE Transactions on Automatic Control 45, 741–746. MR1764845, Crossref (Cit. on p. 192)Google Scholar

Gamarnik, David (2003). Stability of adaptive and nonadaptive packet routing policies in adversarial queueing networks. SIAM Journal on Computing 32, 371–385. MR1969395, Crossref (Cit. on p. 192)Google Scholar

Gamarnik, David and Hasenbein, John J. (2005). Instability in stochastic and fluid queueing networks. The Annals of Applied Probability 15, 1652–1690. MR2152240, Crossref (Cit. on p. 146)Google Scholar

Goel, Ashish (2001). Stability of networks and protocols in the adversarial queueing model for packet routing. Networks 37, 219–224. MR1837200, Crossref (Cit. on p. 192)Google Scholar

Harrison, J. Michael (1973). Assembly-like queues. Journal of Applied Probability 10, 354–367. MR0356276, Crossref (Cit. on p. 123)Google Scholar

Harrison, J. Michael (1988). Brownian models of queueing networks with heterogeneous customer populations. Stochastic Differential Systems, Stochastic Control Theory and Applications. Ed. by W. Fleming and P. L. Lions. Vol. 10. The IMA Volumes in Mathematics and Its Applications. Springer, New York, NY, 147–186. MR0934722, Crossref (Cit. on pp. 27, 53)Google Scholar

Harrison, J. Michael (1998). Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies. The Annals of Applied Probability 8, 822–848. MR1627791, Crossref (Cit. on p. 28)Google Scholar

Harrison, J. Michael (2000). Brownian models of open processing networks: canonical representation of workload. The Annals of Applied Probability 10, 75–103; corrections: 13, 390–393 (2003), and 16, 1703–1732 (2006). MR1765204, Crossref (Cit. on pp. 27, 53, 123)Google Scholar

Harrison, J. Michael (2002). Stochastic networks and activity analysis. Analytic Methods in Applied Probability: in memory of Fridrikh Karpelevich. Ed. by Yu. M. Suhov. Vol. 207. American Mathematical Society Translations: Series 2. American Mathematical Society, Providence, RI, 53–76. MR1992207, Crossref (Cit. on p. 28)Google Scholar

Harrison, J. Michael (2003). A broader view of Brownian networks. The Annals of Applied Probability 13, 1119–1150. MR1994047, Crossref (Cit. on pp. 27, 53)Google Scholar

Harrison, J. Michael (2013). Brownian Models of Performance and Control. Cambridge University Press, Cambridge, UK. MR3157450, Crossref (Cit. on p. 130)Google Scholar

Harrison, J. Michael and López, Marcel J. (1999). Heavy traffic resource pooling in parallel-server systems. Queueing Systems. Theory and Applications 33, 339–368. MR1742575, Crossref (Cit. on p. 106)Google Scholar

Harrison, J. Michael and Nguyen, Viên (1993). Brownian models of multiclass queueing networks: current status and open problems. Queueing Systems. Theory and Applications 13, 5–40. MR1218842, Crossref (Cit. on p. 159)Google Scholar

Harrison, J. Michael and Wein, Lawrence M. (1989). Scheduling networks of queues: heavy traffic analysis of a simple open network. Queueing Systems. Theory and Applications 5, 265–279. MR1030470, Crossref (Cit. on p. 28)Google Scholar

Hasenbein, John J. (1997). Necessary conditions for global stability of multiclass queueing networks. Operations Research Letters 21, 87–94. MR1482493, Crossref (Cit. on p. 193)Google Scholar

Humes, Carlos Jr. (1994). A regulator stabilization technique: Kumar–Seidman revisited. IEEE Transactions on Automatic Control 39, 191–196. MR1258702, Crossref (Cit. on p. 193)Google Scholar

Isaacson, Eugene and Keller, Herbert B. (2012). Analysis of Numerical Methods. Dover Books on Mathematics. Dover Publications, Mineola, NY. Crossref (Cit. on p. 369)Google Scholar

Jackson, J. R. (1957). Networks of waiting lines. Operations Research 5, 518–521. MR0093061, Crossref (Cit. on p. 77)Google Scholar

Kang, W. N., Kelly, F. P., Lee, N. H., and Williams, R. J. (2009). State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy. The Annals of Applied Probability 19, 1719–1780. MR2569806, Crossref (Cit. on pp. 43, 106, 250)Google Scholar

Kannan, R. and Krueger, Carole K. (1996). Advanced Analysis on the Real Line. Universitext. Springer-Verlag, New York, NY. MR1390758, Crossref (Cit. on p. 165)Google Scholar

Kelly, Frank P. (1975). Networks of queues with customers of different types. Journal of Applied Probability 12, 542–554. MR0388571, Crossref (Cit. on p. 78)Google Scholar

Kelly, Frank P. (1979). Reversibility and Stochastic Networks. Wiley Series in Probability and Mathematical Statistics. John Wiley & Sons, Ltd., Chichester, UK. MR554920, Crossref (Cit. on pp. 50, 52, 53, 78, 106)Google Scholar

Kelly, Frank P. (1997). Charging and rate control for elastic traffic. European Transactions on Telecommunications 8, 33–37. Crossref (Cit. on p. 250)Google Scholar

Kelly, Frank P., Maulloo, A. K., and Tan, D. K. H. (1998). Rate control for communication networks: shadow prices, proportional fairness and stability. Journal of Operations Research Society 49, 237–252. Crossref (Cit. on p. 250)Google Scholar

Kleinrock, Leonard (1967). Time-shared systems: a theoretical treatment. Journal of the Association for Computing Machinery 14, 242–261. MR273994, Crossref (Cit. on pp. 46, 87, 95)CrossRefGoogle Scholar

Koehler, Gary J., Whinston, Andrew B., and Wright, Gordon P. (1975). Optimization over Leontief Substitution Systems. North-Holland Publishing Co., Amsterdam, Netherlands–Oxford, UK; American Elsevier Publishing Co., Inc., New York, NY. MR0416562, Crossref (Cit. on p. 217)Google Scholar

Koopmans, T. C., editor (1951). Activity Analysis of Production and Allocation. John Wiley & Sons, New York, NY. Crossref (Cit. on p. 3)Google Scholar

Kumar, P. R. (1993). Re-entrant lines. Queueing Systems. Theory and Applications 13, 87–110. MR1218845, Crossref (Cit. on p. 24)Google Scholar

Latouche, G. and Ramaswami, V. (1999). Introduction to Matrix Analytic Methods in Stochastic Modeling. ASA-SIAM Series on Statistics and Applied Probability. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA. Crossref (Cit. on p. 359)Google Scholar

Laws, C. N. and Louth, G. M. (1990). Dynamic scheduling of a four-station queueing networks. Probability in the Engineering and Informational Sciences 4, 131–156. Crossref (Cit. on p. 106)Google Scholar

Li, Bin and Srikant, R. (2016). Queue-proportional rate allocation with per-link information in multihop wireless networks. Queueing Systems. Theory and Applications 83, 329–359; correction: 84, 203–210, (2016). MR3528494, Crossref (Cit. on p. 310)Google Scholar

Lu, S. H. and Kumar, P. R. (1991). Distributed scheduling based on due dates and buffer priorities. IEEE Transactions on Automatic Control 36, 1406–1416. Crossref (Cit. on p. 28)Google Scholar

Massoulié, Laurent (2007). Structural properties of proportional fairness: stability and insensitivity. The Annals of Applied Probability 17, 809–839. MR2326233, Crossref (Cit. on pp. 106, 165, 192, 250)Google Scholar

Massoulié, Laurent and Roberts, J. W. (2000). Bandwidth sharing and admission control for elastic traffic. Telecommunication Systems 15, 185–201. Crossref (Cit. on pp. 106, 229, 250)Google Scholar

Massoulié, Laurent and Kuang, Xu (2018). On the capacity of information processing systems. Operations Research 66, 568–586. MR3782815, Crossref (Cit. on p. xvii)Google Scholar

McKeown, N., Mekkittikul, A., Anantharam, V., and Walrand, J. (1999). Achieving 100% throughput in an input-queued switch. IEEE Transactions on Communications 47, 1260–1267. Crossref (Cit. on p. 218)Google Scholar

Meyn, Sean P. (1995). Transience of multiclass queueing networks via fluid limit models. The Annals of Applied Probability 5, 946–957. MR1384361, Crossref (Cit. on p. 146)Google Scholar

Meyn, Sean P. and Down, Douglas (1994). Stability of generalized Jackson networks. The Annals of Applied Probability 4, 124–148. MR1258176, Crossref (Cit. on pp. 14, 78)Google Scholar

Meyn, Sean P. and Tweedie, R. L. (1994). State-dependent criteria for convergence of Markov chains. The Annals of Applied Probability 4, 149–168. MR1258177, Crossref (Cit. on p. 342)Google Scholar

Meyn, Sean and Tweedie, Richard L. (2009). Markov Chains and Stochastic Stability. Second Edition. Cambridge University Press, Cambridge, UK. MR2509253, Crossref (Cit. on p. 78)Google Scholar

Mo, J. and Walrand, J. (2000). Fair end-to-end window-based congestion control. IEEE-ACM Transactions on Networking 8, 556–567. Crossref (Cit. on p. 250)Google Scholar

Neely, M. J., Modiano, E., and Rohrs, C. E. (2005). Dynamic power allocation and routing for time-varying wireless networks. IEEE Journal on Selected Areas in Communications 23, 89–103. Crossref (Cit. on p. 217)Google Scholar

Newell, G. F. (1982). Applications of Queueing Theory. Second Edition. Monographs on Statistics and Applied Probability. Chapman & Hall, London, UK. MR737381, Crossref (Cit. on p. 146)Google Scholar

Norris, J. R. (1998). Markov Chains. Vol. 2. Cambridge Series in Statistical and Probabilistic Mathematics. Reprint of 1997 original. Cambridge University Press, Cambridge, UK. MR1600720, Crossref (Cit. on pp. 331, 344, 346, 347, 348, 349, 350, 352, 353, 355)Google Scholar

Pedarsani, Ramtin., Walrand, Jean, and Zhong, Yuan (2014). Scheduling tasks with precedence constraints on multiple servers. 52nd Annual Allerton Conference on Communication, Control, and Computing, 1196–1203. Crossref (Cit. on p. 106)Google Scholar

Pulhaskii, A. A. and Rybko, A. N. (2000). Nonergodicity of queueing networks when their fluid models are unstable. Problems of Information Transmission 36, 23–41. MR1746007, Crossref (Cit. on p. 146)Google Scholar

Rockafellar, R. Tyrrell and Wets, Roger J.-B. (1998). Variational Analysis. Vol. 317. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer-Verlag, Berlin, Germany. MR1491362, Crossref (Cit. on p. 224)Google Scholar

Royden, H. L. (1988). Real Analysis. Third Edition. Macmillan Publishing Company, New York, NY. MR1013117 (Cit. on pp. 311, 312)Google Scholar

Royden, H. L. and Fitzpatrick, P. M. (2010). Real Analysis. Fourth Edition. Pearson, London, UK. Crossref (Cit. on pp. 161, 311, 312, 314, 319)Google Scholar

Rybko, A. N. and Stolyar, A. L. (1992). Ergodicity of stochastic processes describing the operation of open queueing networks. Problems of Information Transmission 28, 199–220. MR1189331, Crossref (Cit. on pp. 20, 28, 146)Google Scholar

Serfozo, Richard (1999). Introduction to Stochastic Networks. Vol. 44. Applications of Mathematics. Springer-Verlag, New York, NY. MR1704237, Crossref (Cit. on pp. 78, 106)Google Scholar

Serfozo, Richard (2009). Basics of Applied Stochastic Processes. Probability and Its Applications. Springer-Verlag, Berlin, Germany. MR2484222, Crossref (Cit. on p. 140)Google Scholar

Shah, Devavrat and Wischik, Damon (2012). Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse. The Annals of Applied Probability 22, 70–127. MR2932543, Crossref (Cit. on p. 310)Google Scholar

Sigman, Karl (1990). The stability of open queueing networks. Stochastic Processes and Their Applications 35, 11–25. MR1062580, Crossref (Cit. on p. 78)Google Scholar

Srikant, R. and Ying, Lei (2014). Communication Networks: An Optimization, Control and Stochastic Networks Perspective. Cambridge University Press, Cambridge, UK. MR3202391, Crossref (Cit. on pp. 225, 250)Google Scholar

Stolyar, A. L. (1995). On the stability of multiclass queueing networks: a relaxed sufficient condition via limiting fluid processes. Markov Processes and Related Fields 1, 491–512. MR1403094, Crossref (Cit. on pp. 146, 147)Google Scholar

Tassiulas, Leandros (1995). Adaptive back-pressure congestion control based on local information. IEEE Transactions on Automatic Control 40, 236–250. MR1312890, Crossref (Cit. on pp. 217, 218, 309)Google Scholar

Tassiulas, Leandros and Bhattacharya, Partha P. (2000). Allocation of interdependent resources for maximal throughput. Communications in Statistics. Stochastic Models 16, 27–48. MR1742516, Crossref (Cit. on p. 218)Google Scholar

Tassiulas, Leandros and Ephremides, Anthony (1992). Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control 37, 1936–1948. MR1200609, Crossref (Cit. on pp. 17, 217, 218, 309)Google Scholar

Tassiulas, Leandros and Georgiadis, L. (1994). Any work-conserving policy stabilizes the ring with spatial reuse. Proceedings of INFOCOM’94 Conference on Computer Communications, 66–70. Crossref (Cit. on p. 192)Google Scholar

Tweedie, R. L. (1976). Criteria for classifying general Markov chains. Advances in Applied Probability 8, 737–771. MR0451409, Crossref (Cit. on p. 342)Google Scholar

Vlasiou, Maria, Zhang, Jiheng, and Zwart, Bert (2014). Insensitivity of proportional fairness in critically loaded bandwidth sharing networks. arXiv e-prints. arXiv: 1411.4841 [math.PR]. Crossref (Cit. on p. 251)Google Scholar

Walton, Neil (2015). Concave switching in single-hop and multihop networks. Queueing Systems. Theory and Applications 81, 265–299. MR3401872, Crossref (Cit. on pp. xvii, 250, 299, 309, 310)Google Scholar

Wang, Weina, Siva Theja Maguluri, R. Srikant, , and Ying, Lei (2017). Heavy-traffic delay insensitivity in connection-level models of data transfer with proportionally fair bandwidth sharing. SIGMETRICS Performance Evaluation Review 45, 232–245. Crossref (Cit. on p. 251)Google Scholar

Wang, Weina, Zhu, K., Ying, L., Tan, J., and Zhang, L. (2014). Maptask scheduling in MapReduce with data locality: throughput and heavy-traffic optimality. IEEE/ACM Transactions on Networking 24, 190–203. Crossref (Cit. on p. 267)Google Scholar

Wein, Lawrence M. (1991). Brownian networks with discretionary routing. Operations Research 39, 322–340. Crossref (Cit. on p. 28)Google Scholar

Xie, Q. and Lu, Y. (2015). Priority algorithm for near-data scheduling: throughput and heavy-traffic optimality. IEEE INFOCOM 2015, IEEE Conference on Computer Communications, 963–972. Crossref (Cit. on p. 267)Google Scholar

Xie, Q., Yekkehkhany, A., and Lu, Y. (2016). Scheduling with multi-level data locality: throughput and heavy-traffic optimality. IEEE INFOCOM 2016, The 35th Annual IEEE International Conference on Computer Communications, 1–9. Crossref (Cit. on p. 267)Google Scholar

Ye, Heng-Qing and Yao, David D. (2012). A stochastic network under proportional fair resource control-diffusion limit with multiple bottlenecks. Operations Research 60, 716–738. MR2960540, Crossref (Cit. on p. 250)Google Scholar