{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:53:02Z","timestamp":1725526382784},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642003929"},{"type":"electronic","value":"9783642003936"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00393-6_9","type":"book-chapter","created":{"date-parts":[[2009,2,26]],"date-time":"2009-02-26T16:56:28Z","timestamp":1235667388000},"page":"70-77","source":"Crossref","is-referenced-by-count":0,"title":["On the Variance of the Least Attained Service Policy and Its Use in Multiple Bottleneck Networks"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Auchmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Urvoy-Keller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Auchmann, M., Urvoy-Keller, G.: On the variance of the least attained service policy and its use in multiple bottleneck networks. Technical Report RR-08-224, Institut Eurecom, France (June 2008), http:\/\/www.eurecom.fr\/util\/popuppubli.fr.htm?page=copyright&id=2497"},{"key":"9_CR2","unstructured":"Brown, P.: Comparing fb and ps scheduling policies. Technical report, Orange Labs (2008)"},{"key":"9_CR3","volume-title":"A Practical Guide to Heavy Tails","author":"M.E. Crovella","year":"1998","unstructured":"Crovella, M.E., et al.: A Practical Guide to Heavy Tails, ch.\u00a03. Chapman and Hall, New-York (1998)"},{"issue":"2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/762483.762486","volume":"21","author":"M. Harchol-Balter","year":"2003","unstructured":"Harchol-Balter, M., Schroeder, B., Bansal, N., Agrawal, M.: Size-based scheduling to improve web performance. ACM Trans. Comput. Syst.\u00a021(2), 207\u2013233 (2003)","journal-title":"ACM Trans. Comput. Syst."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Hernandez-Campos, F., Karaliopoulos, M., Papadopouli, M., Shen, H.: Spatio-temporal modeling of traffic workload in a campus wlan. In: WICON 2006, p. 1 (2006)","DOI":"10.1145\/1234161.1234162"},{"key":"9_CR6","volume-title":"GLOBECOM 2003","author":"M. Hu","year":"2003","unstructured":"Hu, M., Zhang, J., Sadowsky, J.: Size-aided opportunistic scheduling in wireless networks. In: GLOBECOM 2003. IEEE, Los Alamitos (2003)"},{"issue":"3-4","key":"9_CR7","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.peva.2007.06.028","volume":"65","author":"M. Nuyens","year":"2008","unstructured":"Nuyens, M., Wierman, A.: The foreground-background queue: A survey. Perform. Eval.\u00a065(3-4), 286\u2013307 (2008)","journal-title":"Perform. Eval."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Rai, I.A., Urvoy-Keller, G., Biersack, E.W.: Analysis of las scheduling for job size distributions with high variance. In: Proc.\u00a0ACM SIGMETRICS, June 2003, pp. 218\u2013228 (2003)","DOI":"10.1145\/781027.781055"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Rai, I.A., Urvoy-Keller, G., Vernon, M., Biersack, E.W.: Performance models for las-based scheduling disciplines in a packet switched network. In: ACM SIGMETRICS-Performance (June 2004)","DOI":"10.1145\/1005686.1005702"},{"issue":"7","key":"9_CR10","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1287\/mnsc.13.7.466","volume":"13","author":"L.E. Schrage","year":"1967","unstructured":"Schrage, L.E.: The queue m\/g\/1 with feedback to lower priority queues. Management Science\u00a013(7), 466\u2013474 (1967)","journal-title":"Management Science"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/1071690.1064238","volume":"33","author":"A. Wierman","year":"2005","unstructured":"Wierman, A., Harchol-Balter, M.: Classifying scheduling policies with respect to higher moments of conditional response time. ACM SIGMETRICS Performance Evaluation Review\u00a033(1), 229\u2013240 (2005)","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01182931","volume":"2","author":"S. Yashkov","year":"1987","unstructured":"Yashkov, S.: Processor-sharing queues: some progress in analysis. Queueing Systems: Theory and Applications\u00a02(1), 1\u201317 (1987)","journal-title":"Queueing Systems: Theory and Applications"}],"container-title":["Lecture Notes in Computer Science","Network Control and Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00393-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T08:54:47Z","timestamp":1558169687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00393-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642003929","9783642003936"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00393-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}