{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:08Z","timestamp":1740108248411,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T00:00:00Z","timestamp":1498262400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/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":[[2017,10]]},"DOI":"10.1007\/s00186-017-0598-9","type":"journal-article","created":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T05:15:56Z","timestamp":1498281356000},"page":"331-366","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Edge minimality of EDF resource sharing networks"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3073-959X","authenticated-orcid":false,"given":"\u0141ukasz","family":"Kruk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,24]]},"reference":[{"key":"598_CR1","doi-asserted-by":"crossref","unstructured":"Baruah SK (2006) Resource sharing in EDF-scheduled systems: a closer look. In: Proceedings of the 27th IEEE international real-time systems symposium (RTSS\u201906). IEEE Computer Society, Los Alamos, CA","DOI":"10.1109\/RTSS.2006.41"},{"key":"598_CR2","doi-asserted-by":"crossref","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":"598_CR3","unstructured":"Chiang M, Shah D, Tang A (2006) Stochastic stability under fair bandwidth allocation: general file size distribution. In: Proceedings of the 44th Allerton Conference, pp. 899\u2013908"},{"key":"598_CR4","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1214\/aoap\/1015345295","volume":"11","author":"B Doytchinov","year":"2001","unstructured":"Doytchinov B, Lehoczky JP, Shreve SE (2001) Real-time queues in heavy traffic with earliest-deadline-first queue discipline. Ann Appl Probab 11:332\u2013379","journal-title":"Ann Appl Probab"},{"key":"598_CR5","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1214\/105051607000000014","volume":"17","author":"HC Gromoll","year":"2007","unstructured":"Gromoll HC, Kruk \u0141 (2007) Heavy traffic limit for a processor sharing queue with soft deadlines. Ann Appl Probab 17:1049\u20131101","journal-title":"Ann Appl Probab"},{"key":"598_CR6","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1287\/moor.1070.0298","volume":"33","author":"HC Gromoll","year":"2008","unstructured":"Gromoll HC, Robert P, Zwart B (2008) Fluid limits for processor sharing queues with impatience. Math Oper Res 33:375\u2013402","journal-title":"Math Oper Res"},{"key":"598_CR7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1214\/08-AAP541","volume":"19","author":"HC Gromoll","year":"2009","unstructured":"Gromoll HC, Williams RJ (2009) Fluid limits for networks with bandwidth sharing and general document size distribution. Ann Appl Probab 19:243\u2013280","journal-title":"Ann Appl Probab"},{"key":"598_CR8","doi-asserted-by":"crossref","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":"598_CR9","volume-title":"Factory physics: foundations of manufacturing management","author":"W Hopp","year":"1996","unstructured":"Hopp W, Spearman M (1996) Factory physics: foundations of manufacturing management. Irwin, Chicago"},{"key":"598_CR10","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.1214\/08-AAP591","volume":"19","author":"WN Kang","year":"2009","unstructured":"Kang WN, Kelly FP, Lee NH, Williams RJ (2009) State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy. Ann Appl Probab 19:1719\u20131780","journal-title":"Ann Appl Probab"},{"key":"598_CR11","doi-asserted-by":"crossref","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":"598_CR12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s11134-006-7588-6","volume":"53","author":"P Key","year":"2006","unstructured":"Key P, Massouli\u00e9 L (2006) Fluid models of integrated traffic and multipath routing. Queueing Syst 53:85\u201398","journal-title":"Queueing Syst"},{"key":"598_CR13","first-page":"289","volume":"30","author":"\u0141 Kruk","year":"2010","unstructured":"Kruk \u0141 (2010) Invariant states for fluid models of EDF networks: nonlinear lifting map. Probab Math Stat 30:289\u2013315","journal-title":"Probab Math Stat"},{"key":"598_CR14","doi-asserted-by":"crossref","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 Meth Oper Res 84:259\u2013283","journal-title":"Math Meth Oper Res"},{"key":"598_CR15","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1214\/10-AAP681","volume":"21","author":"\u0141 Kruk","year":"2011","unstructured":"Kruk \u0141, Lehoczky JP, Ramanan K, Shreve SE (2011) Heavy traffic analysis for EDF queues with reneging. Ann Appl Probab 21:484\u2013545","journal-title":"Ann Appl Probab"},{"issue":"1","key":"598_CR16","first-page":"40","volume":"20","author":"CL Liu","year":"1973","unstructured":"Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a hard real-time environment. J Assoc Comput Mach 20(1):40\u201361","journal-title":"J Assoc Comput Mach"},{"key":"598_CR17","doi-asserted-by":"crossref","unstructured":"Massouli\u00e9 L, Roberts J (1999) Bandwidth sharing: objectives and algorithms. In: Proceedings of the INFOCOM 2009, eighteenth annual joint conference of the IEEE computer and communications societies, vol 3, pp 1395-1403, IEEE","DOI":"10.1109\/INFCOM.1999.752159"},{"key":"598_CR18","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. Telecommun Syst 15:185\u2013201","journal-title":"Telecommun Syst"},{"key":"598_CR19","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\/ACM Trans Netw 8:556\u2013567","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"4","key":"598_CR20","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1016\/j.orl.2008.01.001","volume":"36","author":"P Moyal","year":"2008","unstructured":"Moyal P (2008) Convex comparison of service disciplines in real time queues. Oper Res Lett 36(4):496\u2013499","journal-title":"Oper Res Lett"},{"key":"598_CR21","unstructured":"Panwar SS, Towsley D (1988) On the optimality of the STE rule for multiple server queues that serve customers with deadlines. Technical Report 88-81, Department of Computer and Information Science, University Massachusetts, Amherst"},{"key":"598_CR22","unstructured":"Panwar SS, Towsley D (1992) Optimality of the stochastic earliest deadline policy for the G\/M\/c queue serving customers with deadlines. In: Second ORSA telecommunications conference. ORSA (Operations Research Society of America), Baltimore, MD"},{"key":"598_CR23","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1137\/1101016","volume":"1","author":"YuV Prohorov","year":"1956","unstructured":"Prohorov YuV (1956) Convergence of random processes and limit theorems in probability theory. Theory Probab Appl 1:157\u2013214","journal-title":"Theory Probab Appl"},{"key":"598_CR24","doi-asserted-by":"crossref","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":"598_CR25","doi-asserted-by":"crossref","unstructured":"Sivaraman V, Chiussi FM, Gerla M (2001) End-to-end statistical delay service under GPS and EDF scheduling: a comparison study. In: Proceedings of the INFOCOM 2001, twentieth annual joint conference of the IEEE computer and communications societies, vol 2, pp 1113\u20131122, IEEE","DOI":"10.1109\/INFCOM.2001.916305"},{"key":"598_CR26","volume-title":"Deadline scheduling for real-time systems: EDF and related algorithms","author":"JA Stankovic","year":"2012","unstructured":"Stankovic JA, Spuri M, Ramamritham K, Buttazzo GC (2012) Deadline scheduling for real-time systems: EDF and related algorithms. Springer, Berlin"},{"key":"598_CR27","doi-asserted-by":"crossref","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"},{"key":"598_CR28","unstructured":"Vlasiou M, Zhang J, Zwart B (2015) Insensitivity of proportional fairness in critically loaded bandwidth sharing networks. \n                        arXiv:1411.4841"},{"key":"598_CR29","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 Trans Autom Control 48:1238\u20131242","journal-title":"IEEE Trans Autom Control"},{"key":"598_CR30","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. Oper Res 53:107\u2013125","journal-title":"Oper Res"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-017-0598-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-017-0598-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-017-0598-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T10:39:28Z","timestamp":1509100768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-017-0598-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,24]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["598"],"URL":"https:\/\/doi.org\/10.1007\/s00186-017-0598-9","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2017,6,24]]}}}