{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:36:45Z","timestamp":1767339405915},"reference-count":24,"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-0427-x","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T10:34:44Z","timestamp":1221215684000},"page":"3-19","source":"Crossref","is-referenced-by-count":11,"title":["SRPT applied to bandwidth-sharing networks"],"prefix":"10.1007","volume":"170","author":[{"given":"Samuli","family":"Aalto","sequence":"first","affiliation":[]},{"given":"Urtzi","family":"Ayesta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,9,13]]},"reference":[{"key":"427_CR1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s00453-006-0193-6","volume":"47","author":"N. Avrahami","year":"2007","unstructured":"Avrahami, N., & Azar, Y. (2007). Minimizing total flow time and total completion time with immediate dispatching. Algorithmica, 47, 253\u2013268.","journal-title":"Algorithmica"},{"key":"427_CR2","volume-title":"Data networks","author":"D. Bertsekas","year":"1992","unstructured":"Bertsekas, D., & Gallager, R. (1992). Data networks (2nd edn.). New York: Prentice-Hall.","edition":"2"},{"key":"427_CR3","doi-asserted-by":"crossref","unstructured":"Bonald, T., & Massouli\u00e9, L. (2001). Impact of fairness on Internet performance. In ACM sigmetrics 2001 (pp.\u00a082\u201391). Cambridge, MA.","DOI":"10.1145\/378420.378438"},{"key":"427_CR4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1023\/A:1024094807532","volume":"44","author":"T. Bonald","year":"2003","unstructured":"Bonald, T., & Prouti\u00e8re, A. (2003). Insensitive bandwidth sharing in data networks. Queueing Systems, 44, 69\u2013100.","journal-title":"Queueing Systems"},{"key":"427_CR5","unstructured":"Bramson, M. (2005). Stability of networks for max-min fair routing. In 13th INFORMS applied probability conference, Ottawa, Canada."},{"key":"427_CR6","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1287\/moor.18.3.658","volume":"18","author":"C. S. Chang","year":"1993","unstructured":"Chang, C. S., & Yao, D. D. (1993). Rearrangement, majorization, and stochastic scheduling. Mathematics of Operations Research, 18, 658\u2013684.","journal-title":"Mathematics of Operations Research"},{"key":"427_CR7","doi-asserted-by":"crossref","unstructured":"Crovella, M., & Bestavros, A. (1996). Self-similarity in world wide web traffic: evidence and possible causes. In ACM SIGMETRICS 1996 (pp. 160\u2013169), Philadelphia, PA.","DOI":"10.1145\/233013.233038"},{"key":"427_CR8","first-page":"556","volume":"8","author":"G. Veciana de","year":"2001","unstructured":"de Veciana, G., Lee, T.-J., & Konstantopoulos, T. (2001). Stability and performance analysis of networks supporting elastic services. IEEE Transactions on Networking, 8, 556\u2013567.","journal-title":"IEEE Transactions on Networking"},{"key":"427_CR9","doi-asserted-by":"crossref","unstructured":"Feldmann, A., & Whitt, W. (1997). Fitting mixtures of exponentials to long-tail distributions to analyze network performance models. In IEEE infocom 1997 (pp. 1096\u20131104), Kobe, Japan.","DOI":"10.1109\/INFCOM.1997.631130"},{"key":"427_CR10","unstructured":"Gromoll, H. C., & Williams, R. J. (2006). Fluid limit of a network with fair bandwidth sharing and general document size distribution. Preprint."},{"key":"427_CR11","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/opre.40.2.376","volume":"40","author":"T. Hirayama","year":"1992","unstructured":"Hirayama, T., & Kijima, M. (1992). Single machine scheduling problem when the machine capacity varies stochastically. Operations Research, 40, 376\u2013383.","journal-title":"Operations Research"},{"key":"427_CR12","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/ett.4460080106","volume":"8","author":"F. P. Kelly","year":"1997","unstructured":"Kelly, F. P. (1997). Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8, 33\u201337.","journal-title":"European Transactions on Telecommunications"},{"key":"427_CR13","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1057\/palgrave.jors.2600523","volume":"49","author":"F. P. Kelly","year":"1998","unstructured":"Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998). Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49, 237\u2013252.","journal-title":"Journal of the Operational Research Society"},{"key":"427_CR14","doi-asserted-by":"crossref","unstructured":"Massouli\u00e9, L., & Roberts, J. (1999). Bandwidth sharing: objectives and algorithms. In IEEE infocom 1999 (pp. 1395\u20131403), New York, NY.","DOI":"10.1109\/INFCOM.1999.752159"},{"key":"427_CR15","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1023\/A:1019138827659","volume":"15","author":"L. Massouli\u00e9","year":"2000","unstructured":"Massouli\u00e9, L., & Roberts, J. (2000). Bandwidth sharing and admission control for elastic traffic. Telecommunication Systems, 15, 185\u2013201.","journal-title":"Telecommunication Systems"},{"key":"427_CR16","unstructured":"Massouli\u00e9, L. (2005). Structural properties of proportional fairness: stability and insensitivity. Preprint."},{"key":"427_CR17","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1109\/90.879343","volume":"8","author":"J. Mo","year":"2000","unstructured":"Mo, J., & Walrand, J. (2000). Fair end-to-end window-based congestion control. IEEE Transactions on Networking, 8, 556\u2013567.","journal-title":"IEEE Transactions on Networking"},{"key":"427_CR18","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, 687\u2013690.","journal-title":"Operations Research"},{"key":"427_CR19","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1287\/opre.26.1.197","volume":"26","author":"D. R. Smith","year":"1978","unstructured":"Smith, D. R. (1978). A new proof of the optimality of the shortest remaining processing time discipline. Operations Research, 26, 197\u2013199.","journal-title":"Operations Research"},{"key":"427_CR20","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.peva.2005.07.008","volume":"62","author":"I. M. Verloop","year":"2005","unstructured":"Verloop, I. M., Borst, S. C., & N\u00fa\u00f1ez-Queija, R. (2005). Stability of size-based scheduling disciplines in resource-sharing networks. Performance Evaluation, 62, 247\u2013262.","journal-title":"Performance Evaluation"},{"key":"427_CR21","doi-asserted-by":"crossref","unstructured":"Verloop, I. M., Borst, S. C., & N\u00fa\u00f1ez-Queija, R. (2006). Delay optimization in bandwidth-sharing networks. In CISS 2006, Princeton, NJ.","DOI":"10.1109\/CISS.2006.286658"},{"key":"427_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01182931","volume":"2","author":"S. F. Yashkov","year":"1987","unstructured":"Yashkov, S. F. (1987). Processor-sharing queues: some progress in analysis. Queueing Systems, 2, 1\u201317.","journal-title":"Queueing Systems"},{"key":"427_CR23","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1109\/TAC.2003.814269","volume":"48","author":"H.-Q. Ye","year":"2003","unstructured":"Ye, H.-Q. (2003). Stability of data networks under an optimization-based bandwidth allocation. IEEE Transactions on Automatic Control, 48, 1238\u20131242.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"427_CR24","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1287\/opre.1040.0139","volume":"53","author":"H.-Q. Ye","year":"2005","unstructured":"Ye, H.-Q., Ou, J., & Yuan, X.-M. (2005). Stability of data networks: stationary and bursty models. Operations Research, 53, 107\u2013125.","journal-title":"Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0427-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0427-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0427-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:50Z","timestamp":1559138870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0427-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,13]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["427"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0427-x","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]]}}}