{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T20:49:22Z","timestamp":1680468562955},"reference-count":34,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Performance Evaluation"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1016\/j.peva.2011.07.023","type":"journal-article","created":{"date-parts":[[2011,8,22]],"date-time":"2011-08-22T17:53:45Z","timestamp":1314035625000},"page":"1291-1311","source":"Crossref","is-referenced-by-count":14,"title":["The price of forgetting in parallel and non-observable queues"],"prefix":"10.1016","volume":"68","author":[{"given":"J.","family":"Anselmi","sequence":"first","affiliation":[]},{"given":"B.","family":"Gaujal","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.peva.2011.07.023_br000005","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.parco.2007.02.013","article-title":"Brokering strategies in computational grids using stochastic prediction models","volume":"33","author":"Berten","year":"2007","journal-title":"Parallel Comput."},{"key":"10.1016\/j.peva.2011.07.023_br000010","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10107-002-0362-6","article-title":"Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach","volume":"93","author":"Ni\u00f1o-Mora","year":"2002","journal-title":"Math. Program."},{"key":"10.1016\/j.peva.2011.07.023_br000015","doi-asserted-by":"crossref","first-page":"637","DOI":"10.2307\/3214547","article-title":"On an index policy for restless bandits","volume":"27","author":"Weber","year":"1990","journal-title":"J. Appl. Probab."},{"key":"10.1016\/j.peva.2011.07.023_br000020","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/71.824633","article-title":"How useful is old information?","volume":"11","author":"Mitzenmacher","year":"2000","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.peva.2011.07.023_br000025","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1287\/mnsc.29.7.831","article-title":"Individual versus social optimization in the allocation of customers to alternative servers","volume":"29","author":"Bell","year":"1983","journal-title":"Manage. Sci."},{"key":"10.1016\/j.peva.2011.07.023_br000030","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(94)90292-5","article-title":"Optimization of static traffic allocation policies","volume":"125","author":"Comb\u00e9","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.peva.2011.07.023_br000035","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1145\/1035334.1035355","article-title":"Optimal probabilistic routing in distributed parallel queues","volume":"32","author":"Guo","year":"2004","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"10.1016\/j.peva.2011.07.023_br000040","series-title":"An Introduction to Queueing Networks","author":"Walrand","year":"1988"},{"key":"10.1016\/j.peva.2011.07.023_br000045","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/moor.10.4.543","article-title":"Extremal splitting of point processes","volume":"10","author":"Hajek","year":"1986","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.peva.2011.07.023_br000050","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/moor.27.3.518.314","article-title":"Minimizing service and operation costs of periodic scheduling","volume":"27","author":"Bar-Noy","year":"2002","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.peva.2011.07.023_br000055","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10626-006-6179-3","article-title":"Optimal routing in two parallel queues with exponential service times","volume":"16","author":"Gaujal","year":"2006","journal-title":"Discrete Event Dyn. Syst."},{"key":"10.1016\/j.peva.2011.07.023_br000060","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1109\/71.940749","article-title":"An efficient adaptive scheduling scheme for distributed memory multicomputers","volume":"12","author":"Thanalapati","year":"2001","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.peva.2011.07.023_br000065","series-title":"GRID\u201908: Proceedings of the 2008 9th IEEE\/ACM International Conference on Grid Computing","first-page":"136","article-title":"Dynamic scheduling for heterogeneous desktop grids","author":"Al-Azzoni","year":"2008"},{"key":"10.1016\/j.peva.2011.07.023_br000070","doi-asserted-by":"crossref","unstructured":"B. Javadi, D. Kondo, J.-M. Vincent, D. Anderson, Discovering statistical models of availability in large distributed systems: An empirical study of SETI@home. IEEE Trans. Parallel Distrib. Syst. (2011) (in press).","DOI":"10.1109\/TPDS.2011.50"},{"key":"10.1016\/j.peva.2011.07.023_br000075","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/B:CLUS.0000018564.05723.a2","article-title":"Evaluation of task assignment policies for supercomputing servers: the case for load unbalancing and fairness","volume":"7","author":"Schroeder","year":"2004","journal-title":"Cluster Computing"},{"key":"10.1016\/j.peva.2011.07.023_br000080","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1145\/506147.506154","article-title":"Task assignment with unknown duration","volume":"49","author":"Harchol-Balter","year":"2002","journal-title":"J. ACM"},{"key":"10.1016\/j.peva.2011.07.023_br000085","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0167-6377(92)90091-G","article-title":"Algorithms for generalized round robin routing","volume":"12","author":"Arian","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.peva.2011.07.023_br000090","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s001860300322","article-title":"Periodic routing to parallel queues and billiard sequences","volume":"59","author":"Hordijk","year":"2004","journal-title":"Math. Methods Oper. Res."},{"key":"10.1016\/j.peva.2011.07.023_br000095","series-title":"STACS","first-page":"404","article-title":"Worst-case equilibria","volume":"vol. 1563","author":"Koutsoupias","year":"1999"},{"key":"10.1016\/j.peva.2011.07.023_br000100","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1145\/1811099.1811083","article-title":"The price of anarchy in parallel queues revisited","volume":"38","author":"Anselmi","year":"2010","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"10.1016\/j.peva.2011.07.023_br000105","unstructured":"J. Anselmi, B. Gaujal, Optimal routing in parallel, non-observable queues and the price of anarchy revisited, in: 22nd International Teletraffic Congress, ITC-22, pp. 1\u20138."},{"key":"10.1016\/j.peva.2011.07.023_br000110","series-title":"Discrete-Event Control of Stochastic Networks: Multimodularity and Regularity","volume":"vol. 1829","author":"Altman","year":"2003"},{"key":"10.1016\/j.peva.2011.07.023_br000115","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1145\/2157.322409","article-title":"The proof of a folk theorem on queueing delay with applications to routing in networks","volume":"30","author":"Hajek","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/j.peva.2011.07.023_br000120","series-title":"Queueing Systems, Volume 2: Computer Applications","author":"Kleinrock","year":"1976"},{"key":"10.1016\/j.peva.2011.07.023_br000125","series-title":"Convex Optimization","author":"Boyd","year":"2004"},{"key":"10.1016\/j.peva.2011.07.023_br000130","series-title":"An Introduction to Queueing Theory: Modeling and Analysis in Applications","author":"Bhat","year":"2008"},{"key":"10.1016\/j.peva.2011.07.023_br000135","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF02124750","article-title":"On the Lambert w function","author":"Corless","year":"1996","journal-title":"Adv. Comput. Math."},{"key":"10.1016\/j.peva.2011.07.023_br000140","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/j.orl.2006.09.005","article-title":"The price of anarchy in an exponential multi-server","volume":"35","author":"Haviv","year":"2007","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.peva.2011.07.023_br000145","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1093\/biomet\/49.3-4.315","article-title":"Some inequalities for the queue gi\/g\/1","volume":"49","author":"Kingman","year":"1962","journal-title":"Biometrika"},{"key":"10.1016\/j.peva.2011.07.023_br000150","series-title":"Algorithmic Game Theory","author":"Nisan","year":"2007"},{"key":"10.1016\/j.peva.2011.07.023_br000155","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/S0022-0000(03)00044-8","article-title":"The price of anarchy is independent of the network topology","volume":"67","author":"Roughgarden","year":"2003","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.peva.2011.07.023_br000160","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1109\/TNET.2007.909752","article-title":"A comparative analysis of server selection in content replication networks","volume":"16","author":"Wu","year":"2008","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.peva.2011.07.023_br000165","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1145\/1453175.1453200","article-title":"The effect of local scheduling in load balancing designs","volume":"36","author":"Chen","year":"2008","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"10.1016\/j.peva.2011.07.023_br000170","series-title":"INFOCOM\u201910","first-page":"436","article-title":"Price of anarchy in non-cooperative load balancing","author":"Ayesta","year":"2010"}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531611001234?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531611001234?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T07:18:14Z","timestamp":1560496694000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166531611001234"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":34,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["S0166531611001234"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.peva.2011.07.023","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[2011,12]]}}}
