{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:43:02Z","timestamp":1750308182561,"version":"3.41.0"},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2004,9,1]],"date-time":"2004-09-01T00:00:00Z","timestamp":1093996800000},"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":[[2004,9]]},"abstract":"<jats:p>We consider the fundamental problem of routing customers among distributed parallel queues to minimize an objective function based on equilibrium sojourn times under general assumptions for the arrival and service processes and under the assumption that customers are routed to the parallel queues in a probabilistic manner. More specifically, we derive explicit solutions for the asymptotically optimal vector of probabilities that control the routing of customers upon arrival among a set of heterogeneous general single-server queues through stochastic-process limits. Our assumption of probabilistic routing is consistent with previous theoretical studies of this optimization problem, and our solutions can be used for the parameter settings of other routing mechanisms found in practice. Stochastic-process limits are exploited in order to be able to handle general arrival and service processes and obtain explicit solutions to the scheduling optimization problems of interest.<\/jats:p>","DOI":"10.1145\/1035334.1035355","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"53-54","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Optimal probabilistic routing in distributed parallel queues"],"prefix":"10.1145","volume":"32","author":[{"given":"Xin","family":"Guo","sequence":"first","affiliation":[{"name":"IBM Thomas J. Watson Research Center, Yorktown Heights, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingdong","family":"Lu","sequence":"additional","affiliation":[{"name":"IBM Thomas J. Watson Research Center, Yorktown Heights, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark S.","family":"Squillante","sequence":"additional","affiliation":[{"name":"IBM Thomas J. Watson Research Center, Yorktown Heights, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,9]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Nonlinear Programming","author":"Bertsekas D. P.","year":"1999","unstructured":"D. P. Bertsekas . Nonlinear Programming . Athena Scientific , 2 nd edition, 1999 . D. P. Bertsekas. Nonlinear Programming. Athena Scientific, 2nd edition, 1999.","edition":"2"},{"key":"e_1_2_1_2_1","volume-title":"Fundamentals of Queueing Networks","author":"Chen H.","year":"2002","unstructured":"H. Chen and D. D. Yao . Fundamentals of Queueing Networks . Springer-Verlag , 2002 . H. Chen and D. D. Yao. Fundamentals of Queueing Networks. Springer-Verlag, 2002."},{"key":"e_1_2_1_3_1","volume-title":"IBM Research Division","author":"Guo X.","year":"2003","unstructured":"X. Guo , Y. Lu , and M. S. Squillante . Optimal stochastic routing in distributed parallel queues. Technical report , IBM Research Division , November 2003 . Revised , April 2004. X. Guo, Y. Lu, and M. S. Squillante. Optimal stochastic routing in distributed parallel queues. Technical report, IBM Research Division, November 2003. Revised, April 2004."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.3.464"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"W. Whitt. Stochastic-Process Limits. Springer-Verlag New York 2002.  W. Whitt. Stochastic-Process Limits. Springer-Verlag New York 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\/1035334.1035355","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1035334.1035355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:24:29Z","timestamp":1750263869000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1035334.1035355"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["10.1145\/1035334.1035355"],"URL":"https:\/\/doi.org\/10.1145\/1035334.1035355","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2004,9]]},"assertion":[{"value":"2004-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}