Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks

References

• [1] Andrews M, Kumaran K, Ramanan K, Stolyar AL, Vijayakumar R, Whiting P (2004) Scheduling in a queueing system with asynchronously varying service rates. Probab. Engrg. Inform. Sci. 18(2):191–217.Crossref, Google Scholar
• [2] Atar R, Biswas A, Kaspi H (2015) Fluid limits of G/G/1 + G queues under the non-preemptive earliest-deadline-first discipline. Math. Oper. Res. 40(3):683–702.Link, Google Scholar
• [3] Atar R, Biswas A, Kaspi H, Ramanan K (2018) A Skorokhod map on measure-valued paths with applications to priority queues. Ann. Appl. Probab. 28(1):418–481.Crossref, Google Scholar
• [4] Averklouris A, Vlasiou M, Zwart B (2019) A stochastic resource-sharing network for mobile vehicle charging. IEEE Trans. Control Network Systems 6(3):1050–1061.Crossref, Google Scholar
• [5] Bäuerle N (2000) Asymptotic optimality of tracking policies in stochastic networks. Ann. Appl. Probab. 10(4):1065–1083.Crossref, Google Scholar
• [6] Bäuerle N (2002) Optimal control of queueing networks: An approach via fluid models. Adv. Appl. Probab. 34(2):313–328.Crossref, Google Scholar
• [7] Birand B, Chudnovsky M, Ries B, Seymour P, Zussman G, Zwols Y (2012) Analyzing the performance of greedy maximal scheduling via local pooling and graph theory. IEEE/ACM Trans. Networking 20(1):163–176.Crossref, Google Scholar
• [8] Bonald T, Massoulié L (2001) Impact of fairness on Internet performance. Mary K. Vernon (ed.). Proc. 2001 ACM SIGMETRICS Internat. Conf. Measurement Model. Comput. Systems (Association for Computing Machinery, New York), 82–91.Google Scholar
• [9] Bramson M (1996a) Convergence to equilibria for fluid models of FIFO queueing networks. Queueing Systems 22:5–45.Crossref, Google Scholar
• [10] Bramson M (1996b) Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networks. Queueing Systems 23:1–26.Crossref, Google Scholar
• [11] Bramson M (1998) State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Systems 30:89–148.Crossref, Google Scholar
• [12] Bramson M (2001) Stability of earliest-due-date, first-served queueing networks. Queueing Systems 39:79–102.Crossref, Google Scholar
• [13] Chen H, Yao DD (2001) Fundamentals of Queueing Networks (Springer-Verlag, New York).Google Scholar
• [14] Chiang M, Shah D, Tang A (2006) Stochastic stability under fair bandwidth allocation: General file size distribution. Proc. 44th Allerton Conf. Comm., Control, Comput., (Curran Associates, Inc., Red Hook, New York), 899–908.Google Scholar
• [15] Dai JG (1995) On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Ann. Appl. Probab. 5(1):49–77.Crossref, Google Scholar
• [16] Decreusefond L, Moyal P (2008) Fluid limit of a heavily loaded EDF queue with impatient customers. Markov Processes Related Fields 14(1):131–158.Google Scholar
• [17] Dimakis A, Walrand J (2006) Sufficient conditions for stability of longest-queue-first scheduling: Second order properties using fluid limits. Adv. Appl. Probab. 38(2):505–521.Crossref, Google Scholar
• [18] Down DG, Gromoll HC, Puha AL (2009) Fluid limits for shortest remaining processing time queues. Math. Oper. Res. 34(4):880–911.Link, Google Scholar
• [19] Doytchinov B, Lehoczky JP, Shreve SE (2001) Real-time queues in heavy traffic with earliest-deadline-first queue discipline. Ann. Appl. Probab. 11(2):332–378.Crossref, Google Scholar
• [20] Gromoll HC, Williams RJ (2009) Fluid limits for networks with bandwidth sharing and general document size distribution. Ann. Appl. Probab. 19(1):243–280.Crossref, Google Scholar
• [21] Gurvich I, Van Mieghem JA (2015) Collaboration and multitasking in networks: Architectures, bottlenecks and capacity. Manufacturing Service Oper. Management 17(1):16–33.Link, Google Scholar
• [22] Gurvich I, Van Mieghem JA (2017) Collaboration and multitasking in networks: Prioritization and achievable capacity. Management Sci. 64(5):2390–2406.Link, Google Scholar
• [23] Harrison JM (1988) Brownian models of queueing networks with heterogeneous customer populations. Fleming W, Lions PL, eds. Stochastic Differential Systems, Stochastic Control Theory and Applications, IMA Volumes in Mathematics and Its Applications, vol. 10 (Springer, New York), 147–186.Google Scholar
• [24] Harrison JM (1996) The BIGSTEP approach to flow management in stochastic processing networks. Kelly F, Zachary S, Ziedlins I, eds. Stochastic Networks: Stochastic Control Theory and Applications, Royal Statistical Society Lecture Notes Series, vol. 4 (Claredon Press, Oxford, UK), 57–89.Google Scholar
• [25] Harrison JM (2000) Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Probab. 10(1):75–103.Crossref, Google Scholar
• [26] Harrison JM, Mandayam C, Shah D, Yang Y (2014) Resource sharing networks: Overview and an open problem. Stochastic Systems. 4(2):524–555.Link, Google Scholar
• [27] Kang WN, Kelly FP, Lee NH, Williams RJ (2009) State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy. Ann. Appl. Probab. 19(5):1719–1780.Crossref, Google Scholar
• [28] Kelly FP (1997) Charging and rate control for elastic traffic. Eur. Trans. Telecomm. 8(1):33–37.Crossref, Google Scholar
• [29] Kelly FP, Williams RJ (2004) Fluid model for a network operating under a fair bandwidth-sharing policy. Ann. Appl. Probab. 14(3):1055–1083.Crossref, Google Scholar
• [30] Kelly FP, Williams RJ (2010) Heavy traffic on a controlled motorway. Bingham NH, Goldie CM, eds. Probability and Mathematical Genetics, London Mathematical Society Lecture Note Series, vol. 378 (Cambridge University Press, Cambridge, UK), 416–445.Crossref, Google Scholar
• [31] Key P, Massoulié L (2006) Fluid models of integrated traffic and multipath routing. Queueing Systems 53:85–98.Crossref, Google Scholar
• [32] Kruk Ł (2008) Stability of two families of real-time queueing networks. Probab. Math. Statist. 28(2):179–202.Google Scholar
• [33] Kruk Ł (2010) Invariant states for fluid models of EDF networks: Nonlinear lifting map. Probab. Math. Statist. 30(2):289–315.Google Scholar
• [34] Kruk Ł (2016) Minimality of EDF networks with resource sharing. Math. Methods Oper. Res. 84(2):259–283.Crossref, Google Scholar
• [35] Kruk Ł (2017) Edge minimality of EDF resource sharing networks. Math. Methods Oper. Res. 86(2):331–366.Crossref, Google Scholar
• [36] Kruk Ł (2018) Stability of linear EDF networks with resource sharing. Queueing Systems 88:167–203.Crossref, Google Scholar
• [37] Kruk Ł (2019a) Open problem-protocols for resource sharing networks with locally edge minimal fluid models. Stochastic Systems 9(3):303–304.Link, Google Scholar
• [38] Kruk Ł (2019b) Stability of preemptive EDF queueing networks. Ann. Univ. Mariae Curie-Skłodowska A: Math. 73(2):105–134.Google Scholar
• [39] Kruk Ł (2020) Continuity and monotonicity of solutions to a greedy maximization problem. Math. Methods Oper. Res. 92:33–76.Crossref, Google Scholar
• [40] Kruk Ł, Sokołowska E (2016) Fluid limits for multiple-input shortest remaining processing time queues. Math. Oper. Res. 41(3):1055–1092.Link, Google Scholar
• [41] Lu Y, Squillante MS, Suk T (2020) Optimal control in fluid models of general n × n input-queued switches under linear fluid-flow costs. arXiv: 1910.13657v2.Google Scholar
• [42] Maglaras C (1999) Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policies. Queueing Systems 31:171–206.Crossref, Google Scholar
• [43] Maglaras C (2000) Discrete-review policies for scheduling stochastic networks: Trajectory tracking and fluid-scale asymptotic optimality. Ann. Appl. Probab. 10(3):897–929.Crossref, Google Scholar
• [44] Massoulié L, Roberts J (1999) Bandwidth sharing: Objectives and algorithms. Proc. IEEE INFOCOM 1999 Conf. Comput. Commun., vol. 3 (Institute of Electrical and Electronics Engineers, Piscataway, NJ), 1395–1403.Google Scholar
• [45] Massoulié L, Roberts J (2000) Bandwidth sharing and admission control for elastic traffic. Telecomm. Systems 15:185–201.Crossref, Google Scholar
• [46] McKeown N (1995) Scheduling algorithms for input-queued cell switches. Unpublished doctoral thesis, University of California, Berkeley.Google Scholar
• [47] Meyn SP (1997) Stability and optimization of queueing networks and their fluid models. Yin GG, Zhang Q, eds. Mathematics of Stochastic Manufacturing Systems. Lectures in Applied Mathematics, vol. 33 (American Mathematical Society, Providence, RI), 175–199.Google Scholar
• [48] Mo J, Walrand J (2000) Fair end-to-end window-based congestion control. IEEE/ACM Trans. Networking 8(5):556–567.Crossref, Google Scholar
• [49] Nazarathy Y, Weiss G (2009) Nearly optimal control of queueing networks over a finite time horizon. Ann. Oper. Res. 170:233–249.Crossref, Google Scholar
• [50] Rybko AN, Stolyar AL (1992) Ergodicity of stochastic processes describing the operations of open queueing networks. Probl. Inform. Transmission 28(3):199–220.Google Scholar
• [51] Stolyar AL (2004) Maxweight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Probab. 14(1):1–53.Crossref, Google Scholar
• [52] Verloop M, Borst S, Núñez-Queija R (2005) Stability of size-based scheduling disciplines in resource-sharing networks. Perform. Eval. 62(1–4):247–262.Crossref, Google Scholar
• [53] Vlasiou M, Zhang J, Zwart B (2015) Insensitivity of proportional fairness in critically loaded bandwidth sharing networks. Preprint, submitted June 17, http://arxiv.org/pdf/1411.4841v2.Google Scholar
• [54] Weiss G (1999) An algorithm for minimum wait draining of two station fluid re-entrant line. Ann. Oper. Res. 92:65–86.Crossref, Google Scholar
• [55] Weiss G (2008) A simplex based algorithm to solve separated continuous linear programs. Math. Programming 115:151–198.Google Scholar
• [56] Williams RJ (1998) Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse. Queueing Systems 30:27–88.Crossref, Google Scholar
• [57] Ye HQ (2003) Stability of data networks under an optimization-based bandwidth allocation. IEEE Trans. Automatic Control 48(7):1238–1242.Crossref, Google Scholar
• [58] Ye HQ, Yao DD (2012) A stochastic network under proportional fair resource control—Diffusion limits with multiple bottlenecks. Oper. Res. 60(3):716–738.Link, Google Scholar
• [59] Ye HQ, Ou J, Yuan XM (2005) Stability of data networks: Stationary and bursty models. Oper. Res. 53(1):107–125.Link, Google Scholar