{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:17Z","timestamp":1740108257636,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,10,7]],"date-time":"2022-10-07T00:00:00Z","timestamp":1665100800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,10,7]],"date-time":"2022-10-07T00:00:00Z","timestamp":1665100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider a general network with arbitrary topology and node capacities, in which users require simultaneous service from a number of shared resources. We study pathwise minimality of the shortest remaining processing time protocol with respect to suitable criteria based on the system\u2019s cumulative transmission times of flows with residual service requirements not greater than any threshold value on the network routes. No distributional assumptions are made on the underlying stochastic primitives.<\/jats:p>","DOI":"10.1007\/s00186-022-00801-0","type":"journal-article","created":{"date-parts":[[2022,10,7]],"date-time":"2022-10-07T05:02:30Z","timestamp":1665118950000},"page":"459-492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Local edge minimality of SRPT networks with shared resources"],"prefix":"10.1007","volume":"96","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3073-959X","authenticated-orcid":false,"given":"\u0141ukasz","family":"Kruk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6419-3209","authenticated-orcid":false,"given":"Robert","family":"Gieroba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,7]]},"reference":[{"key":"801_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-008-0427-x","volume":"170","author":"S Aalto","year":"2009","unstructured":"Aalto S, Ayesta U (2009) SRPT applied to bandwidth sharing networks. Ann Oper Res 170:3\u201319","journal-title":"Ann Oper Res"},{"key":"801_CR2","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1214\/17-AAP1309","volume":"28","author":"R Atar","year":"2018","unstructured":"Atar R, Biswas A, Kaspi H, Ramanan K (2018) A Skorokhod map on measure-valued paths with applications to priority queues. Ann Appl Probab 28:418\u2013481","journal-title":"Ann Appl Probab"},{"unstructured":"Bender M, Chakrabarti S, Muthukrishnan S (1998) Flow and stretch metrics for scheduling continuous job streams. In: Proceedings of the 9th annual ACM-SIAM symposium on discrete algorithms","key":"801_CR3"},{"key":"801_CR4","volume-title":"Data networks","author":"D Bertsekas","year":"1992","unstructured":"Bertsekas D, Gallager R (1992) Data networks, 2nd edn. Prentice-Hall, New York","edition":"2"},{"key":"801_CR5","doi-asserted-by":"publisher","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 Syst Theory Appl 44:69\u2013100","journal-title":"Queueing Syst Theory Appl"},{"key":"801_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/A:1017987600517","volume":"39","author":"M Bramson","year":"2001","unstructured":"Bramson M (2001) Stability of earliest-due-date, first-served queueing networks. Queueing Syst Theory Appl 39:79\u2013102","journal-title":"Queueing Syst Theory Appl"},{"key":"801_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s11134-021-09733-8","volume":"101","author":"T Chojecki","year":"2022","unstructured":"Chojecki T, Kruk \u0141 (2022) Instability of SRPT, SERPT and SJF queueing networks. Queueing Syst Theory Appl 101:57\u201392","journal-title":"Queueing Syst Theory Appl"},{"issue":"12","key":"801_CR8","doi-asserted-by":"publisher","first-page":"7708","DOI":"10.1287\/mnsc.2021.4110","volume":"67","author":"J Dong","year":"2021","unstructured":"Dong J, Ibrahim R (2021) On the SRPT scheduling discipline in many-server queues with impatient customers. Manag Sci 67(12):7708\u20137718","journal-title":"Manag Sci"},{"key":"801_CR9","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1287\/moor.1090.0409","volume":"34","author":"DG Down","year":"2009","unstructured":"Down DG, Gromoll HC, Puha AL (2009) Fluid limits for shortest remaining processing time queues. Math Oper Res 34:880\u2013911","journal-title":"Math Oper Res"},{"key":"801_CR10","doi-asserted-by":"publisher","first-page":"74","DOI":"10.37394\/23206.2021.20.8","volume":"20","author":"R Gieroba","year":"2021","unstructured":"Gieroba R, Kruk \u0141 (2021) Minimality of SRPT networks with resource sharing. WSEAS Trans Math 20:74\u201383","journal-title":"WSEAS Trans Math"},{"key":"801_CR11","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.peva.2018.10.001","volume":"127\u2013128","author":"I Grosof","year":"2018","unstructured":"Grosof I, Scully Z, Harchol-Balter M (2018) SRPT for multiserver systems. Perform Eval 127\u2013128:154\u2013175","journal-title":"Perform Eval"},{"key":"801_CR12","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1287\/13-SSY130","volume":"4","author":"JM Harrison","year":"2014","unstructured":"Harrison JM, Mandayam C, Shah D, Yang Y (2014) Resource sharing networks: overview and an open problem. Stoch Syst 4:524\u2013555","journal-title":"Stoch Syst"},{"key":"801_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1002\/ett.4460080106","volume":"8","author":"FP Kelly","year":"1997","unstructured":"Kelly FP (1997) Charging and rate control for elastic traffic. Eur Trans Telecom 8:33\u201337","journal-title":"Eur Trans Telecom"},{"key":"801_CR14","first-page":"179","volume":"28","author":"\u0141 Kruk","year":"2008","unstructured":"Kruk \u0141 (2008) Stability of two families of real-time queueing networks. Probab Math Stat 28:179\u2013202","journal-title":"Probab Math Stat"},{"key":"801_CR15","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s00186-016-0543-3","volume":"84","author":"\u0141 Kruk","year":"2016","unstructured":"Kruk \u0141 (2016) Minimality of EDF networks with resource sharing. Math Methods Oper Res 84:259\u2013283","journal-title":"Math Methods Oper Res"},{"key":"801_CR16","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s00186-017-0598-9","volume":"86","author":"\u0141 Kruk","year":"2017","unstructured":"Kruk \u0141 (2017) Edge minimality of EDF resource sharing networks. Math Methods Oper Res 86:331\u2013366","journal-title":"Math Methods Oper Res"},{"key":"801_CR17","first-page":"105","volume":"73","author":"\u0141 Kruk","year":"2019","unstructured":"Kruk \u0141 (2019) Stability of preemptive EDF queueing networks. Ann Univ Mariae Curie-Sk\u0142odowska Math A 73:105\u2013134","journal-title":"Ann Univ Mariae Curie-Sk\u0142odowska Math A"},{"key":"801_CR18","doi-asserted-by":"publisher","first-page":"1513","DOI":"10.1287\/moor.2020.1110","volume":"46","author":"\u0141 Kruk","year":"2021","unstructured":"Kruk \u0141 (2021) Minimal and locally edge minimal fluid models for resource sharing networks. Math Oper Res 46:1513\u20131551","journal-title":"Math Oper Res"},{"doi-asserted-by":"crossref","unstructured":"Massouli\u00e9 L, Roberts J (1999) Bandwidth sharing: objectives and algorithms. In Proceedings of the INFOCOM \u201999, eighteenth annual joint conference of the IEEE computer and communications societies, vol 3. IEEE, pp 1395\u20131403","key":"801_CR19","DOI":"10.1109\/INFCOM.1999.752159"},{"key":"801_CR20","doi-asserted-by":"publisher","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. Telecomm Syst 15:185\u2013201","journal-title":"Telecomm Syst"},{"key":"801_CR21","doi-asserted-by":"publisher","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\/ACM Trans Netw 8:556\u2013567","journal-title":"IEEE\/ACM Trans Netw"},{"key":"801_CR22","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1020905810996","volume":"113","author":"R N\u00fa\u00f1ez-Queija","year":"2002","unstructured":"N\u00fa\u00f1ez-Queija R (2002) Queues with equally heavy sojourn time and service requirement distributions. Ann Oper Res 113:101\u2013117","journal-title":"Ann Oper Res"},{"key":"801_CR23","doi-asserted-by":"publisher","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 Syst Theory Appl 54:85\u201397","journal-title":"Queueing Syst Theory Appl"},{"key":"801_CR24","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1287\/opre.16.3.687","volume":"16","author":"LE Schrage","year":"1968","unstructured":"Schrage LE (1968) A proof of the optimality of the shortest remaining processing time discipline. Oper Res 16:687\u2013690","journal-title":"Oper Res"},{"key":"801_CR25","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1287\/opre.14.4.670","volume":"14","author":"LE Schrage","year":"1966","unstructured":"Schrage LE, Miller LW (1966) The queue M\/G\/1 with the shortest remaining processing time discipline. Oper Res 14:670\u2013684","journal-title":"Oper Res"},{"key":"801_CR26","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1287\/opre.26.1.197","volume":"26","author":"DR Smith","year":"1976","unstructured":"Smith DR (1976) A new proof of the optimality of the shortest remaining processing time discipline. Oper Res 26:197\u2013199","journal-title":"Oper Res"},{"key":"801_CR27","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.peva.2005.07.008","volume":"62","author":"M Verloop","year":"2005","unstructured":"Verloop M, Borst S, N\u00fa\u00f1ez-Queija R (2005) Stability of size-based scheduling disciplines in resource-sharing networks. Perform Eval 62:247\u2013262","journal-title":"Perform Eval"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-022-00801-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-022-00801-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-022-00801-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T02:23:59Z","timestamp":1669688639000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-022-00801-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,7]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["801"],"URL":"https:\/\/doi.org\/10.1007\/s00186-022-00801-0","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2022,10,7]]},"assertion":[{"value":"31 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}