{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:04:08Z","timestamp":1743113048543,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030925109"},{"type":"electronic","value":"9783030925116"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92511-6_8","type":"book-chapter","created":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T14:05:12Z","timestamp":1638885912000},"page":"126-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["First Frontier Monotonicity for\u00a0Fluid Models of\u00a0Multiclass EDF Queueing Networks"],"prefix":"10.1007","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":[[2021,12,8]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1287\/moor.2014.0690","volume":"40","author":"R Atar","year":"2015","unstructured":"Atar, R., Biswas, A., Kaspi, H.: Fluid limits of G\/G\/1+G queues under the non-preemptive earliest-deadline-first discipline. Math. Oper. Res. 40, 683\u2013702 (2015)","journal-title":"Math. Oper. Res."},{"issue":"7","key":"8_CR2","doi-asserted-by":"publisher","first-page":"2270","DOI":"10.1016\/j.spa.2017.09.009","volume":"128","author":"R Atar","year":"2018","unstructured":"Atar, R., Biswas, A., Kaspi, H.: Law of large numbers for the many-server earliest-deadline-first queue. Stochast. Process. Appl. 128(7), 2270\u20132296 (2018)","journal-title":"Stochast. Process. Appl."},{"key":"8_CR3","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.: A Skorokhod map on measure-valued paths with applications to priority queues. Ann. Appl. Probab. 28, 418\u2013481 (2018)","journal-title":"Ann. Appl. Probab."},{"key":"8_CR4","unstructured":"Atar, R., Shadmi, Y.: Fluid limits for earliest-deadline-first networks. arXiv arXiv:2009.07169v1 (2020)"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01159391","volume":"22","author":"M Bramson","year":"1996","unstructured":"Bramson, M.: Convergence to equilibria for fluid models of FIFO queueing networks. Queueing Syst. Theor. Appl. 22, 5\u201345 (1996)","journal-title":"Queueing Syst. Theor. Appl."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01206549","volume":"23","author":"M Bramson","year":"1996","unstructured":"Bramson, M.: Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networks. Queueing Syst. Theor. Appl. 23, 1\u201326 (1996)","journal-title":"Queueing Syst. Theor. Appl."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/A:1019160803783","volume":"30","author":"M Bramson","year":"1998","unstructured":"Bramson, M.: State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Syst. Theor. Appl. 30, 89\u2013148 (1998)","journal-title":"Queueing Syst. Theor. Appl."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/A:1017987600517","volume":"39","author":"M Bramson","year":"2001","unstructured":"Bramson, M.: Stability of earliest-due-date, first-served queueing networks. Queueing Systems. Theor. Appl. 39, 79\u2013102 (2001)","journal-title":"Queueing Systems. Theor. Appl."},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Chen, H., Yao, D.D.: Fundamentals of Queueing Networks. Springer Science$$+$$Business Media, LLC, New York (2001). https:\/\/doi.org\/10.1007\/978-1-4757-5301-1","DOI":"10.1007\/978-1-4757-5301-1"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1214\/aoap\/1177004828","volume":"5","author":"JG Dai","year":"1995","unstructured":"Dai, J.G.: On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Ann. Appl. Probab. 5, 49\u201377 (1995)","journal-title":"Ann. Appl. Probab."},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Dai, J.G., Prabhakar, B.: The throughput of data switches with and without speedup. In: Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. 19th Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 2, pp. 556\u2013564 (2000). https:\/\/doi.org\/10.1109\/INFCOM.2000.832229","DOI":"10.1109\/INFCOM.2000.832229"},{"issue":"1","key":"8_CR12","first-page":"131","volume":"14","author":"L Decreusefond","year":"2008","unstructured":"Decreusefond, L., Moyal, P.: Fluid limit of a heavily loaded EDF queue with impatient customers. Markov Process. Relat. Fields 14(1), 131\u2013158 (2008)","journal-title":"Markov Process. Relat. Fields"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1214\/aoap\/1015345295","volume":"11","author":"B Doytchinov","year":"2001","unstructured":"Doytchinov, B., Lehoczky, J.P., Shreve, S.E.: Real-time queues in heavy traffic with earliest-deadline-first queue discipline. Ann. Appl. Probab. 11, 332\u2013379 (2001)","journal-title":"Ann. Appl. Probab."},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Harrison, J.M.: Brownian models of queueing networks with heterogeneous customer populations. In: Fleming, W., Lions, P.L. (eds.) Stochastic Differential Systems, Stochastic Control Theory and Applications. The IMA Volumes in Mathematics and Its Applications, vol. 10, pp. 147\u2013186. Springer, New York (1988). https:\/\/doi.org\/10.1007\/978-1-4613-8762-6_11","DOI":"10.1007\/978-1-4613-8762-6_11"},{"key":"8_CR15","first-page":"179","volume":"28","author":"\u0141 Kruk","year":"2008","unstructured":"Kruk, \u0141: Stability of two families of real-time queueing networks. Probab. Math. Stat. 28, 179\u2013202 (2008)","journal-title":"Probab. Math. Stat."},{"key":"8_CR16","first-page":"289","volume":"30","author":"\u0141 Kruk","year":"2010","unstructured":"Kruk, \u0141: Invariant states for fluid models of EDF networks: nonlinear lifting map. Probab. Math. Stat. 30, 289\u2013315 (2010)","journal-title":"Probab. Math. Stat."},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.1110.0495","volume":"36","author":"\u0141 Kruk","year":"2011","unstructured":"Kruk, \u0141: An open queueing network with asymptotically stable fluid model and unconventional heavy traffic behavior. Math. Oper. Res. 36, 538\u2013551 (2011)","journal-title":"Math. Oper. Res."},{"key":"8_CR18","first-page":"105","volume":"73","author":"\u0141 Kruk","year":"2019","unstructured":"Kruk, \u0141: Stability of preemptive EDF queueing networks. Ann. Univ. Mariae Curie-Sk\u0142odowska Math. A. 73, 105\u2013134 (2019)","journal-title":"Ann. Univ. Mariae Curie-Sk\u0142odowska Math. A."},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Kruk, \u0141.: Minimal and locally edge minimal fluid models for resource sharing networks. Math. Oper. Res. (2021). https:\/\/doi.org\/10.1287\/moor.2020.1110","DOI":"10.1287\/moor.2020.1110"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1214\/10-AAP681","volume":"21","author":"\u0141 Kruk","year":"2011","unstructured":"Kruk, \u0141, Lehoczky, J.P., Ramanan, K., Shreve, S.E.: Heavy traffic analysis for EDF queues with reneging. Ann. Appl. Probab. 21, 484\u2013545 (2011)","journal-title":"Ann. Appl. Probab."},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.1214\/105051604000000314","volume":"14","author":"\u0141 Kruk","year":"2004","unstructured":"Kruk, \u0141, Lehoczky, J.P., Shreve, S.E., Yeung, S.-N.: Earliest-deadline-first service in heavy traffic acyclic networks. Ann. Appl. Probab. 14, 1306\u20131352 (2004)","journal-title":"Ann. Appl. Probab."},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/258623.258685","volume":"25","author":"JP Lehoczky","year":"1997","unstructured":"Lehoczky, J.P.: Using real-time queueing theory to control lateness in real-time systems. Perform. Eval. Rev. 25, 158\u2013168 (1997)","journal-title":"Perform. Eval. Rev."},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Lehoczky, J.P.: Real-time queueing theory. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 186\u2013195 (1998)","DOI":"10.1145\/258612.258685"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Lehoczky, J.P.: Scheduling communication networks carrying real-time traffic. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 470\u2013479 (1998)","DOI":"10.1109\/REAL.1998.739780"},{"issue":"1","key":"8_CR25","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/321738.321743","volume":"20","author":"CL Liu","year":"1973","unstructured":"Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard real-time environment. J. Assoc. Comput. Mach. 20(1), 40\u201361 (1973)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"4","key":"8_CR26","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1016\/j.orl.2008.01.001","volume":"36","author":"P Moyal","year":"2008","unstructured":"Moyal, P.: Convex comparison of service disciplines in real time queues. Oper. Res. Lett. 36(4), 496\u2013499 (2008)","journal-title":"Oper. Res. Lett."},{"key":"8_CR27","unstructured":"Panwar, S.S., Towsley, D.: 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 (1988)"},{"key":"8_CR28","unstructured":"Panwar, S.S., Towsley, D.: Optimality of the stochastic earliest deadline policy for the G\/M\/c queue serving customers with deadlines. In: 2nd ORSA Telecommunications Conference. ORSA (Operations Research Society of America), Baltimore, MD (1992)"},{"key":"8_CR29","first-page":"199","volume":"28","author":"AN Rybko","year":"1992","unstructured":"Rybko, A.N., Stolyar, A.L.: Ergodicity of stochastic processes describing the operations of open queueing networks. Probl. Inf. Transm. 28, 199\u2013220 (1992)","journal-title":"Probl. Inf. Transm."},{"key":"8_CR30","doi-asserted-by":"publisher","first-page":"2166","DOI":"10.1109\/9.328805","volume":"39","author":"TI Seidman","year":"1994","unstructured":"Seidman, T.I.: \u201cFirst come, first served\u2019\u2019 can be unstable! IEEE Trans. Automat. Control 39, 2166\u20132171 (1994)","journal-title":"IEEE Trans. Automat. Control"},{"key":"8_CR31","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1023\/A:1019108819713","volume":"30","author":"RJ Williams","year":"1998","unstructured":"Williams, R.J.: Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse. Queueing Syst. Theor. Appl. 30, 27\u201388 (1998)","journal-title":"Queueing Syst. Theor. Appl."},{"key":"8_CR32","unstructured":"Yeung, S.-N., Lehoczky, J.P.: Real-time queueing networks in heavy traffic with EDF and FIFO queue discipline. Working paper, Department of Statistics, Carnegie Mellon University (2001)"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Performance Evaluation Methodologies and Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92511-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T23:02:02Z","timestamp":1726268522000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92511-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030925109","9783030925116"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92511-6_8","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"8 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VALUETOOLS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"EAI International Conference on Performance Evaluation Methodologies and Tools","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"valuetools2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}