{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:38Z","timestamp":1750221098557,"version":"3.41.0"},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T00:00:00Z","timestamp":1547683200000},"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":[[2019,1,18]]},"abstract":"<jats:p>We consider the problem of allocating requesters of analytic tasks to resources on servers. We assume both requesters and servers are placed in a one dimensional line: [0,1) according to two Poisson processes with each server having finite capacity. Requesters communicate with servers under a noninterference wireless protocol. We consider a \"Move to Right\" (MTR) request allocation strategy where each requester is allocated to the nearest available server to its right. We start our analysis from a single resource per request scenario where each requester demands a single computational resource. We map this scenario to an M\/M\/1 queue or a bulk service M\/M\/1 queue depending on the server capacity. We compare the performance of the MTR strategy with the globally optimal strategy taking \"expected distance traveled by a request\" (request distance) as performance metric. Next, we extend our analysis to two resources per request scenario. We show that the behavior of MTR can be transformed into an equivalent fork-join queue problem. Numerical results are presented to validate the claim.<\/jats:p>","DOI":"10.1145\/3305218.3305229","type":"journal-article","created":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T17:15:15Z","timestamp":1547745315000},"page":"27-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A queueing-theoretic model for resource allocation in one-dimensional distributed analytics network?"],"prefix":"10.1145","volume":"46","author":[{"given":"Nitish K.","family":"Panigrahy","sequence":"first","affiliation":[{"name":"University of Massachusetts, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prithwish","family":"Basu","sequence":"additional","affiliation":[{"name":"Raytheon BBN Technologies, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Don","family":"Towsley","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ananthram","family":"Swami","sequence":"additional","affiliation":[{"name":"Army Research Laboratory, Adelphi, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin S.","family":"Chan","sequence":"additional","affiliation":[{"name":"Army Research Laboratory, Adelphi, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kin K.","family":"Leung","sequence":"additional","affiliation":[{"name":"Imperial College London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,1,17]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795295936"},{"key":"e_1_2_1_2_1","volume-title":"A Survey on Device-to-device Communication in Cellular Networks","author":"Asadi A.","year":"2013","unstructured":"A. Asadi , Q. Wang , and V. Mancuso . A Survey on Device-to-device Communication in Cellular Networks . In IEEE Commun. Surv. Tut , 2013 . A. Asadi, Q. Wang, and V. Mancuso. A Survey on Device-to-device Communication in Cellular Networks. In IEEE Commun. Surv. Tut, 2013."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2010.05.010"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524388"},{"key":"e_1_2_1_5_1","volume-title":"Queueing Systems","author":"Kleinrock L.","year":"1976","unstructured":"L. Kleinrock . Queueing Systems . John Wiley and Sons , 1976 . L. Kleinrock. Queueing Systems. John Wiley and Sons, 1976."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.2213"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02614365"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3305218.3305229","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3305218.3305229","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:58:09Z","timestamp":1750208289000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3305218.3305229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,17]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,1,18]]}},"alternative-id":["10.1145\/3305218.3305229"],"URL":"https:\/\/doi.org\/10.1145\/3305218.3305229","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2019,1,17]]},"assertion":[{"value":"2019-01-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}