{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:20:49Z","timestamp":1750220449748,"version":"3.41.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T00:00:00Z","timestamp":1614902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2021,3,5]]},"abstract":"<jats:p>We consider a fluid model of n x n input-queued switches with associated fluid-flow costs and derive an optimal scheduling control policy to an infinite horizon discounted control problem with a general linear objective function of fluid cost. Our optimal policy coincides with the c\u03bc-rule in certain parameter domains, but more generally, takes the form of the solution to a flow maximization problem. Computational experiments demonstrate the benefits of our optimal scheduling policy over variants of max-weight scheduling and the c\u03bc-rule.<\/jats:p>","DOI":"10.1145\/3453953.3453981","type":"journal-article","created":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T04:12:32Z","timestamp":1615003952000},"page":"122-127","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Control in Fluid Models of nxn Input-Queued Switches under Linear Fluid-Flow Costs"],"prefix":"10.1145","volume":"48","author":[{"given":"Yingdong","family":"Lu","sequence":"first","affiliation":[{"name":"IBM Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark S.","family":"Squillante","sequence":"additional","affiliation":[{"name":"IBM Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tonghoon","family":"Suk","sequence":"additional","affiliation":[{"name":"IBM Research"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,3,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250813"},{"key":"e_1_2_1_2_1","volume-title":"Fluid models of sequencing problems in open queueing networks","author":"Avram Florin","year":"1995","unstructured":"Florin Avram , Dimitris Bertsimas , and Michael Ricard . 1995. Fluid models of sequencing problems in open queueing networks ; an optimal control approach. Stochastic Networks ( 1995 ), 199--234. Florin Avram, Dimitris Bertsimas, and Michael Ricard. 1995. Fluid models of sequencing problems in open queueing networks; an optimal control approach. Stochastic Networks (1995), 199--234."},{"key":"e_1_2_1_3_1","volume-title":"Optimal control of single-server fluid networks. QUESTA 35, 1 (01","author":"B\u00e4uerle Nicole","year":"2000","unstructured":"Nicole B\u00e4uerle and Ulrich Rieder . 2000. Optimal control of single-server fluid networks. QUESTA 35, 1 (01 Jul 2000 ), 185--200. Nicole B\u00e4uerle and Ulrich Rieder. 2000. Optimal control of single-server fluid networks. QUESTA 35, 1 (01 Jul 2000), 185--200."},{"volume-title":"Convergence of Probability Measures","author":"Billingsley P.","key":"e_1_2_1_4_1","unstructured":"P. Billingsley . 2013. Convergence of Probability Measures . Wiley . P. Billingsley. 2013. Convergence of Probability Measures. Wiley."},{"key":"e_1_2_1_5_1","volume-title":"State space collapse with application to heavy traffc limits for multiclass queueing networks. QUESTA 30, 1 (01","author":"Bramson Maury","year":"1998","unstructured":"Maury Bramson . 1998. State space collapse with application to heavy traffc limits for multiclass queueing networks. QUESTA 30, 1 (01 Nov 1998 ), 89--140. Maury Bramson. 1998. State space collapse with application to heavy traffc limits for multiclass queueing networks. QUESTA 30, 1 (01 Nov 1998), 89--140."},{"key":"e_1_2_1_6_1","unstructured":"H. Chen and D.D. Yao. 2001. Fundamentals of Queueing Networks: Performance Asymptotics and Optimization. Springer.  H. Chen and D.D. Yao. 2001. Fundamentals of Queueing Networks: Performance Asymptotics and Optimization. Springer."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2784206.2784219"},{"key":"e_1_2_1_8_1","unstructured":"D. R. Cox and W. L. Smith. 1961. Queues. Methuen.  D. R. Cox and W. L. Smith. 1961. Queues. Methuen."},{"volume-title":"INFOCOM '00","author":"Dai J.G.","key":"e_1_2_1_9_1","unstructured":"J.G. Dai and B. Prabhakar . 2000. The throughput of data switches with and without speedup . In INFOCOM '00 . 556--564. J.G. Dai and B. Prabhakar. 2000. The throughput of data switches with and without speedup. In INFOCOM '00. 556--564."},{"key":"e_1_2_1_10_1","volume-title":"On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models. Ann. Appl. Probab. 5, 1 (02","author":"Dai J. G.","year":"1995","unstructured":"J. G. Dai . 1995. On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models. Ann. Appl. Probab. 5, 1 (02 1995 ), 49--77. https:\/\/doi.org\/10.1214\/aoap\/1177004828 10.1214\/aoap J. G. Dai. 1995. On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models. Ann. Appl. Probab. 5, 1 (02 1995), 49--77. https:\/\/doi.org\/10.1214\/aoap\/1177004828"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"W. N. Kang and R. J. Williams. 2012. Diffusion approximation for an input-queued packet switch operating under a maximum weight algorithm. Sto. Sys. (2012).  W. N. Kang and R. J. Williams. 2012. Diffusion approximation for an input-queued packet switch operating under a maximum weight algorithm. Sto. Sys. (2012).","DOI":"10.1287\/12-SSY061"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3003977.3003993"},{"volume-title":"Optimal Dynamic Control for Input-Queued Switches in Heavy Traffic. In ACC '18","author":"Lu Y.","key":"e_1_2_1_13_1","unstructured":"Y. Lu , S.T. Maguluri , M.S. Squillante , and T. Suk . 2018 . Optimal Dynamic Control for Input-Queued Switches in Heavy Traffic. In ACC '18 . Y. Lu, S.T. Maguluri, M.S. Squillante, and T. Suk. 2018. Optimal Dynamic Control for Input-Queued Switches in Heavy Traffic. In ACC '18."},{"key":"e_1_2_1_14_1","unstructured":"Yingdong Lu Mark S. Squillante and Tonghoon Suk. 2020. Optimal Scheduling Control in Fluid Models of General n\u00d7n Input-Queued Switches. (2020). arXiv:1910.13657v2.  Yingdong Lu Mark S. Squillante and Tonghoon Suk. 2020. Optimal Scheduling Control in Fluid Models of General n\u00d7n Input-Queued Switches. (2020). arXiv:1910.13657v2."},{"key":"e_1_2_1_15_1","volume-title":"Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality. Ann. Appl. Probab. 10, 3 (08","author":"Maglaras Constantinos","year":"2000","unstructured":"Constantinos Maglaras . 2000. Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality. Ann. Appl. Probab. 10, 3 (08 2000 ), 897--929. https:\/\/doi.org\/10.1214\/aoap\/1019487513 10.1214\/aoap Constantinos Maglaras. 2000. Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality. Ann. Appl. Probab. 10, 3 (08 2000), 897--929. https:\/\/doi.org\/10.1214\/aoap\/1019487513"},{"key":"e_1_2_1_16_1","volume-title":"Sai Kiran Burle, and R. Srikant","author":"Maguluri Siva Theja","year":"2016","unstructured":"Siva Theja Maguluri , Sai Kiran Burle, and R. Srikant . 2016 . Optimal Heavy-Traffic Queue Length Scaling in an Incompletely Saturated Switch. Preprint ( 2016). Siva Theja Maguluri, Sai Kiran Burle, and R. Srikant. 2016. Optimal Heavy-Traffic Queue Length Scaling in an Incompletely Saturated Switch. Preprint (2016)."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/15-SSY193"},{"key":"e_1_2_1_18_1","volume-title":"INFOCOM '96","volume":"1","author":"McKeown N.","unstructured":"N. McKeown , V. Anantharam , and J. Walrand . 1996. Achieving 100switch . In INFOCOM '96 , Vol. 1 . 296--302 vol.1. N. McKeown, V. Anantharam, and J. Walrand. 1996. Achieving 100switch. In INFOCOM '96, Vol. 1. 296--302 vol.1."},{"key":"e_1_2_1_19_1","unstructured":"L.S. Pontryagin V.G. Boltyanskii R.V. Gamkrelidze and E.F. Mishchenko. 1962. The Mathematical Theory of Optimal Processes. Interscience New York.  L.S. Pontryagin V.G. Boltyanskii R.V. Gamkrelidze and E.F. Mishchenko. 1962. The Mathematical Theory of Optimal Processes. Interscience New York."},{"key":"e_1_2_1_20_1","unstructured":"D. Shah J. N. Tsitsiklis and Y. Zhong. 2015. On queue-size scaling for inputqueued switches. arxiv preprint http:\/\/arxiv.org\/abs\/1405.4764.  D. Shah J. N. Tsitsiklis and Y. Zhong. 2015. On queue-size scaling for inputqueued switches. arxiv preprint http:\/\/arxiv.org\/abs\/1405.4764."},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"D. Shah N. S.Walton and Y. Zhong. 2014. Optimal queue-size scaling in switched networks. Ann. Appl. Probab. 24 6 (12 2014) 2207--2245.  D. Shah N. S.Walton and Y. Zhong. 2014. Optimal queue-size scaling in switched networks. Ann. Appl. Probab. 24 6 (12 2014) 2207--2245.","DOI":"10.1214\/13-AAP970"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1214\/11-AAP759"},{"key":"e_1_2_1_23_1","volume-title":"MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Probab. 14, 1 (02","author":"Stolyar Alexander L.","year":"2004","unstructured":"Alexander L. Stolyar . 2004. MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Probab. 14, 1 (02 2004 ), 1--53. https:\/\/doi.org\/10.1214\/aoap\/1075828046 10.1214\/aoap Alexander L. Stolyar. 2004. MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Probab. 14, 1 (02 2004), 1--53. https:\/\/doi.org\/10.1214\/aoap\/1075828046"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3453953.3453981","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3453953.3453981","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:51Z","timestamp":1750193271000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3453953.3453981"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,5]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,3,5]]}},"alternative-id":["10.1145\/3453953.3453981"],"URL":"https:\/\/doi.org\/10.1145\/3453953.3453981","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2021,3,5]]},"assertion":[{"value":"2021-03-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}