{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T12:16:12Z","timestamp":1654172172119},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s11134-022-09834-y","type":"journal-article","created":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T07:03:57Z","timestamp":1651734237000},"page":"297-299","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Why (and when) do asymptotic methods work so well?"],"prefix":"10.1007","volume":"100","author":[{"given":"Nicolas","family":"Gast","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,5]]},"reference":[{"issue":"11","key":"9834_CR1","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1016\/j.peva.2008.03.005","volume":"65","author":"M Bena\u00efm","year":"2008","unstructured":"Bena\u00efm, M., Le Boudec, J.-Y.: A class of mean field interaction models for computer and communication systems. Perform. Eval. 65(11), 823\u2013838 (2008)","journal-title":"Perform. Eval."},{"key":"9834_CR2","unstructured":"Braverman, A., Dai, J., Fang, X.: High order steady-state diffusion approximations (2020). arXiv preprint arXiv:2012.02824"},{"issue":"2","key":"9834_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/2825236.2825241","volume":"43","author":"F Cecchi","year":"2015","unstructured":"Cecchi, F., Borst, S.C., van Leeuwaarden, J.: Mean-field analysis of ultra-dense CSMA networks. ACM SIGMETRICS Perform. Eval. Rev. 43(2), 13\u201315 (2015)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"9834_CR4","doi-asserted-by":"crossref","unstructured":"Dan, A., Towsley, D.: An approximate analysis of the LRU and FIFO buffer replacement schemes. In: Proceedings of the 1990 ACM SIGMETRICS Conference, pp. 143\u2013152 (1990)","DOI":"10.1145\/98460.98525"},{"issue":"2","key":"9834_CR5","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/S0022-0000(77)80014-7","volume":"14","author":"R Fagin","year":"1977","unstructured":"Fagin, R.: Asymptotic miss ratios over independent references. J. Comput. Syst. Sci. 14(2), 222\u2013250 (1977)","journal-title":"J. Comput. Syst. Sci."},{"key":"9834_CR6","unstructured":"Fricker, C., Robert, P., Roberts, J.: A versatile and accurate approximation for LRU cache performance. In: 2012 24th International Teletraffic Congress (ITC 24), pp. 1\u20138. IEEE (2012)"},{"issue":"2","key":"9834_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/2825236.2825263","volume":"43","author":"N Gast","year":"2015","unstructured":"Gast, N.: The power of two choices on graphs: the pair-approximation is accurate. ACM SIGMETRICS Perform. Eval. Rev. 43(2), 69\u201371 (2015)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"issue":"2","key":"9834_CR8","doi-asserted-by":"publisher","first-page":"33:1","DOI":"10.1145\/3154491","volume":"1","author":"N Gast","year":"2017","unstructured":"Gast, N., Van Houdt, B.: A refined mean field approximation. Proc. ACM Meas. Anal. Comput. Syst. 1(2), 33:1-33:28 (2017)","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"issue":"12","key":"9834_CR9","doi-asserted-by":"publisher","first-page":"2903","DOI":"10.1109\/TMC.2019.2936199","volume":"19","author":"Y-P Hsu","year":"2019","unstructured":"Hsu, Y.-P., Modiano, E., Duan, L.: Scheduling algorithms for minimizing age of information in wireless broadcast networks with random arrivals. IEEE Trans. Mob. Comput. 19(12), 2903\u20132915 (2019)","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"4","key":"9834_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3239164","volume":"3","author":"B Jiang","year":"2018","unstructured":"Jiang, B., Nain, P., Towsley, D.: On the convergence of the TTL approximation for an LRU cache under independent stationary request processes. ACM Trans. Model. Perform. Eval. Comput. Syst. (TOMPECS) 3(4), 1\u201331 (2018)","journal-title":"ACM Trans. Model. Perform. Eval. Comput. Syst. (TOMPECS)"},{"issue":"10","key":"9834_CR11","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1109\/71.963420","volume":"12","author":"M Mitzenmacher","year":"2001","unstructured":"Mitzenmacher, M.: The power of two choices in randomized load balancing. IEEE Trans. Parallel Distrib. Syst. 12(10), 1094\u20131104 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"9834_CR12","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/3003977.3003990","volume":"44","author":"D Mukherjee","year":"2016","unstructured":"Mukherjee, D., Borst, S., Van Leeuwaarden, J., Whiting, P.: Universality of power-of-d load balancing schemes. ACM SIGMETRICS Perform. Eval. Rev. 44(2), 36\u201338 (2016)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"issue":"3","key":"9834_CR13","doi-asserted-by":"publisher","first-page":"637","DOI":"10.2307\/3214547","volume":"27","author":"RR Weber","year":"1990","unstructured":"Weber, R.R., Weiss, G.: On an index policy for restless bandits. J. Appl. Probab. 27(3), 637\u2013648 (1990)","journal-title":"J. Appl. Probab."},{"issue":"A","key":"9834_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.2307\/3214163","volume":"25","author":"P Whittle","year":"1988","unstructured":"Whittle, P.: Restless bandits: activity allocation in a changing world. J. Appl. Probab. 25(A), 287\u2013298 (1988)","journal-title":"J. Appl. Probab."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-022-09834-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11134-022-09834-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-022-09834-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T11:28:47Z","timestamp":1654169327000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11134-022-09834-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":14,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["9834"],"URL":"https:\/\/doi.org\/10.1007\/s11134-022-09834-y","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4]]},"assertion":[{"value":"6 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}