{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:51Z","timestamp":1750308711094,"version":"3.41.0"},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2013,8,27]],"date-time":"2013-08-27T00:00:00Z","timestamp":1377561600000},"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":[[2013,8,27]]},"abstract":"<jats:p>We study a network of parallel single-server queues, where the service speeds are governed by a continuous-time Markov chain. This generic model finds applications in many areas such as communication systems, computer systems and manufacturing systems. We obtain heavy-traffic approximations for the joint workload, delay and queue length processes by combining a functional central limit theorem approach with matrix-analytic methods. In addition, we numerically compute the joint distributions by viewing the limit processes as semi-martingale reflected Brownian motions.<\/jats:p>","DOI":"10.1145\/2518025.2518034","type":"journal-article","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T11:57:11Z","timestamp":1378209431000},"page":"47-49","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Parallel queueing networks with Markov-modulated service speeds in heavy traffic"],"prefix":"10.1145","volume":"41","author":[{"given":"Jan-Pieter","family":"Dorsman","sequence":"first","affiliation":[{"name":"Eindhoven University of Technology, Centrum Wiskunde &amp; Informatica"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Vlasiou","sequence":"additional","affiliation":[{"name":"Eindhoven University of Technology, Centrum Wiskunde &amp; Informatica"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bert","family":"Zwart","sequence":"additional","affiliation":[{"name":"Centrum Wiskunde &amp; Informatica, VU University Amsterdam, Eindhoven University of Technology, Georgia Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,8,27]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5301-1","volume-title":"Fundamentals of Queueing Networks","author":"Chen H.","year":"2001","unstructured":"H. Chen and D.D. Yao . Fundamentals of Queueing Networks . 2001 . H. Chen and D.D. Yao. Fundamentals of Queueing Networks. 2001."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005771"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v14-1437"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/17442508708833469"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-011-9215-4"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0040585X97984796"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/827271.829096"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1081\/STM-120001219"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511807213","volume-title":"Fundamentals of Wireless Communication","author":"Tse D.","year":"2005","unstructured":"D. Tse and P. Viswanath . Fundamentals of Wireless Communication . 2005 . D. Tse and P. Viswanath. Fundamentals of Wireless Communication. 2005."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016667027983"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"W. Whitt. Stochastic-Process Limits. 2002.  W. Whitt. Stochastic-Process Limits. 2002.","DOI":"10.1007\/b97479"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2518025.2518034","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2518025.2518034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:13Z","timestamp":1750277653000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2518025.2518034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,27]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,8,27]]}},"alternative-id":["10.1145\/2518025.2518034"],"URL":"https:\/\/doi.org\/10.1145\/2518025.2518034","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2013,8,27]]},"assertion":[{"value":"2013-08-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}