{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T19:32:14Z","timestamp":1694633534337},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,9,13]],"date-time":"2008-09-13T00:00:00Z","timestamp":1221264000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s10479-008-0432-0","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T14:37:28Z","timestamp":1221230248000},"page":"133-159","source":"Crossref","is-referenced-by-count":1,"title":["Heavy-tailed limits for medium size jobs and comparison scheduling"],"prefix":"10.1007","volume":"170","author":[{"given":"Predrag R.","family":"Jelenkovi\u0107","sequence":"first","affiliation":[]},{"given":"Xiaozhu","family":"Kang","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Tan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,9,13]]},"reference":[{"issue":"1\u20133","key":"432_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1023\/A:1019115910569","volume":"33","author":"V. Anantharam","year":"1999","unstructured":"Anantharam, V. (1999). Scheduling strategies and long-range dependence. Queueing Systems: Theory and Applications, 33(1\u20133), 73\u201389.","journal-title":"Queueing Systems: Theory and Applications"},{"issue":"2","key":"432_CR2","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1239\/aap\/1029955142","volume":"31","author":"S. Asmussen","year":"1999","unstructured":"Asmussen, S., Schmidli, H., & Schmidt, V. (1999). Tail probabilities for non-standard risk and queueing processes with subexponential jumps. Advances in Applied Probability, 31(2), 422\u2013447.","journal-title":"Advances in Applied Probability"},{"key":"432_CR3","volume-title":"Elements of queueing theory: Palm-Martingale calculus and stochastic recurrence","author":"F. Baccelli","year":"1994","unstructured":"Baccelli, F., & Bremaud, P. (1994). Elements of queueing theory: Palm-Martingale calculus and stochastic recurrence. Berlin: Springer."},{"issue":"1","key":"432_CR4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s11134-006-8218-z","volume":"54","author":"N. Bansal","year":"2006","unstructured":"Bansal, N., & Gamarnik, D. (2006). Handling load with less stress. Queueing systems: Theory and Applications, 54(1), 45\u201354.","journal-title":"Queueing systems: Theory and Applications"},{"key":"432_CR5","doi-asserted-by":"crossref","unstructured":"Bansal, N., & Harchol-Balter, M. (2001). Analysis of SRPT scheduling: investigating unfairness. In Proceedings of ACM SIGMETRICS & Performance\u201901 (pp. 279\u2013290). Cambridge, MA.","DOI":"10.1145\/378420.378792"},{"issue":"4","key":"432_CR6","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1023237129453","volume":"43","author":"S. Borst","year":"2003","unstructured":"Borst, S., Boxma, O., & Jelenkovi\u0107, P. (2003a). Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows. Queueing Systems: Theory and Applications, 43(4), 273\u2013306.","journal-title":"Queueing Systems: Theory and Applications"},{"issue":"2","key":"432_CR7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0166-5316(03)00071-3","volume":"54","author":"S. C. Borst","year":"2003","unstructured":"Borst, S. C., Boxma, O. J., N\u00fa\u00f1ez-Queija, R., & Zwart, A. P. (2003b). The impact of the service discipline on delay asymptotics. Performance Evaluation, 54(2), 175\u2013206.","journal-title":"Performance Evaluation"},{"key":"432_CR8","doi-asserted-by":"crossref","unstructured":"Caprita, B., Nieh, J., & Stein, C. (2006). Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling. In PODC\u201906: Proceedings of the twenty-fifth annual ACM symposium on principles of distributed computing (pp. 72\u201381), New York, NY, USA.","DOI":"10.1145\/1146381.1146396"},{"issue":"2","key":"432_CR9","doi-asserted-by":"crossref","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. (2003). Size-based scheduling to improve Web performance. ACM Transactions on Computer Systems (TOCS), 21(2), 207\u2013233.","journal-title":"ACM Transactions on Computer Systems (TOCS)"},{"issue":"2","key":"432_CR10","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1239\/jap\/1032192851","volume":"35","author":"P. R. Jelenkovi\u0107","year":"1998","unstructured":"Jelenkovi\u0107, P. R., & Lazar, A. A. (1998). Subexponential asymptotics of a Markov-modulated random walk with queueing applications. Journal of Applied Probability, 35(2), 325\u2013347.","journal-title":"Journal of Applied Probability"},{"key":"432_CR11","doi-asserted-by":"crossref","unstructured":"Jelenkovi\u0107, P. R., & Mom\u010dilovi\u0107, P. (2002). Resource sharing with subexponential distributions. In Proceedings of IEEE INFOCOM\u201902 (Vol. 3, pp. 1316\u20131325). New York, NY, USA.","DOI":"10.1109\/INFCOM.2002.1019382"},{"issue":"2","key":"432_CR12","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1214\/aoap\/1050689595","volume":"13","author":"P. R. Jelenkovi\u0107","year":"2003","unstructured":"Jelenkovi\u0107, P. R., & Mom\u010dilovi\u0107, P. (2003a). Asymptotic loss probability in a finite buffer fluid queue with heterogeneous heavy-tailed on-off processes. Annals of Applied Probability, 13(2), 576\u2013603.","journal-title":"Annals of Applied Probability"},{"issue":"3","key":"432_CR13","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1287\/moor.28.3.587.16396","volume":"28","author":"P. R. Jelenkovi\u0107","year":"2003","unstructured":"Jelenkovi\u0107, P. R., & Mom\u010dilovi\u0107, P. (2003b). Large deviation analysis of subexponential waiting times in a processor-sharing queue. Mathematics of Operations Research, 28(3), 587\u2013608.","journal-title":"Mathematics of Operations Research"},{"key":"432_CR14","doi-asserted-by":"crossref","unstructured":"Jelenkovi\u0107, P. R., Kang, X., & Tan, J. (2007). Adaptive and scalable comparison scheduling. In Proceedings of ACM SIGMETRICS\u201907 (Vol. 35, No. 1, pp. 215\u2013226). San Diego, CA, USA.","DOI":"10.1145\/1254882.1254907"},{"key":"432_CR15","volume-title":"Queueing systems volume II: computer applications","author":"L. Kleinrock","year":"1976","unstructured":"Kleinrock, L. (1976). Queueing systems volume II: computer applications. New York: Wiley-Interscience."},{"key":"432_CR16","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1017\/S0305004100036781","volume":"58","author":"R. M. Loynes","year":"1962","unstructured":"Loynes, R. M. (1962). The stability of a queue with non-independent inter-arrival and service times. Mathematical Proceedings of the Cambridge Philosophical Society, 58, 497\u2013520.","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"432_CR17","unstructured":"N\u00fa\u00f1ez-Queija, R. (2000). Processor-sharing models for integrated-services networks. PhD thesis, Eindhoven University of Technology, the Netherlands."},{"issue":"2","key":"432_CR18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s11134-006-8767-1","volume":"54","author":"M. Nuyens","year":"2006","unstructured":"Nuyens, M., & Zwart, B. (2006). A large-deviations analysis of the GI\/GI\/1 SRPT queue. Queueing Systems: Theory and Applications, 54(2), 85\u201397.","journal-title":"Queueing Systems: Theory and Applications"},{"issue":"1","key":"432_CR19","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1287\/opre.1070.0504","volume":"56","author":"M. Nuyens","year":"2008","unstructured":"Nuyens, M., Wierman, A., & Zwart, B. (2008). Preventing large sojourn times using SMART scheduling. Operations Research, 56(1), 88\u2013101.","journal-title":"Operations Research"},{"issue":"3","key":"432_CR20","doi-asserted-by":"crossref","first-page":"555","DOI":"10.2307\/3212870","volume":"12","author":"A. Pakes","year":"1975","unstructured":"Pakes, A. (1975). On the tails of waiting-time distributions. Journal of Applied Probability, 12(3), 555\u2013564.","journal-title":"Journal of Applied Probability"},{"key":"432_CR21","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1239\/aap\/1158685002","volume":"38","author":"Z. Palmowski","year":"2006","unstructured":"Palmowski, Z., & Rolski, T. (2006). On the exact asymptotics of the busy period in GI\/G\/1 queues. Advances in Applied Probability, 38, 792\u2013803.","journal-title":"Advances in Applied Probability"},{"key":"432_CR22","volume-title":"Self-similar network traffic and performance evaluation","year":"2000","unstructured":"Park, K., & Willinger, W. (Eds.). (2000). Self-similar network traffic and performance evaluation. New York: Wiley."},{"key":"432_CR23","doi-asserted-by":"crossref","unstructured":"Rai, I. A., Urvoy-Keller, G., Vernon, M. K., & Biersack, E. W. (2004). Performance analysis of LAS-based scheduling disciplines in a packet switched network. In SIGMETRICS\/Performance \u201904 (pp. 106\u2013117). New York, NY, USA.","DOI":"10.1145\/1005686.1005702"},{"issue":"1","key":"432_CR24","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/MNET.2005.1383435","volume":"19","author":"I. A. Rai","year":"2005","unstructured":"Rai, I. A., Biersack, E. W., & Urvoy-Keller, G. (2005). Size-based scheduling to improve the performance of short TCP flows. IEEE Network, 19(1), 12\u201317.","journal-title":"IEEE Network"},{"issue":"1","key":"432_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aoap\/998926986","volume":"11","author":"K. Ramanan","year":"2001","unstructured":"Ramanan, K., & Stolyar, A. L. (2001). Largest weighted delay first scheduling: Large deviations and optimality. Annals of Applied Probability, 11(1), 1\u201348.","journal-title":"Annals of Applied Probability"},{"key":"432_CR26","doi-asserted-by":"crossref","unstructured":"Rawat, M., & Kshemkalyani, A. (2003). SWIFT: Scheduling in web servers for fast response time. In Proceedings of the second IEEE international symposium on network computing and applications (p. 15). Los Alamitos, CA, USA.","DOI":"10.1109\/NCA.2003.1201137"},{"issue":"3","key":"432_CR27","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1287\/opre.16.3.687","volume":"16","author":"L. E. Schrage","year":"1968","unstructured":"Schrage, L. E. (1968). A proof of the optimality of the shortest remaining processing time discipline. Operations Research, 16(3), 687\u2013690.","journal-title":"Operations Research"},{"issue":"4","key":"432_CR28","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1287\/opre.14.4.670","volume":"14","author":"L. E. Schrage","year":"1966","unstructured":"Schrage, L. E., & Miller, L. W. (1966). The queue M\/G\/1 with the shortest remaining processing time discipline. Operations Research, 14(4), 670\u2013684.","journal-title":"Operations Research"},{"issue":"3","key":"432_CR29","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/340242.340323","volume":"27","author":"M. S. Squillante","year":"1999","unstructured":"Squillante, M. S., Yao, D. D., & Zhang, L. (1999). Web traffic modeling and Web server performance analysis. ACM SIGMETRICS Performance Evaluation Review, 27(3), 24\u201327.","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"432_CR30","doi-asserted-by":"crossref","unstructured":"Wierman, A., & Harchol-Balter, M. (2003). Classifying scheduling policies with respect to unfairness in an M\/GI\/1. In Proceedings of ACM SIGMETRICS\u201903 (pp. 238\u2013249). San Diego, CA, USA.","DOI":"10.1145\/781027.781057"},{"key":"432_CR31","volume-title":"Stochastic modeling and theory of queues","author":"R. W. Wolff","year":"1989","unstructured":"Wolff, R. W. (1989). Stochastic modeling and theory of queues. New York: Prentice Hall."},{"issue":"1\u20134","key":"432_CR32","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1019142010994","volume":"35","author":"A. P. Zwart","year":"2000","unstructured":"Zwart, A. P., & Boxma, O. J. (2000). Sojourn time asymptotics in the M\/G\/1 processor sharing queue. Queueing Systems, 35(1\u20134), 141\u2013166.","journal-title":"Queueing Systems"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0432-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0432-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0432-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T10:38:11Z","timestamp":1631788691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0432-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,13]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["432"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0432-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,13]]}}}