{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:53:21Z","timestamp":1750308801970,"version":"3.41.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2009,7,1]],"date-time":"2009-07-01T00:00:00Z","timestamp":1246406400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2009,7]]},"abstract":"<jats:p>\n            We show that for any\n            <jats:italic>r<\/jats:italic>\n            &gt; 0, there is a network of First-In-First-Out servers and a fixed set of sessions such that:\n          <\/jats:p>\n          <jats:p>\n            \u2014The network load is\n            <jats:italic>r<\/jats:italic>\n            with respect to the permanent sessions model with bounded arrivals.\n          <\/jats:p>\n          <jats:p>\u2014The network can be made unstable.<\/jats:p>","DOI":"10.1145\/1541885.1541894","type":"journal-article","created":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T17:28:33Z","timestamp":1247074113000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Instability of FIFO in the permanent sessions model at arbitrarily small network loads"],"prefix":"10.1145","volume":"5","author":[{"given":"Matthew","family":"Andrews","sequence":"first","affiliation":[{"name":"Bell Laboratories, Murray Hill, NJ"}]}],"member":"320","published-online":{"date-parts":[[2009,7,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703435522"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00096-8"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/363647.363677"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979935061X"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703426805"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1755809"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005066"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177004967"},{"key":"e_1_2_1_9_1","first-page":"5","article-title":"Convergence to equilibria for fluid models of FIFO queueing networks. Queue","volume":"22","author":"Bramson M.","year":"1996","unstructured":"]] Bramson , M. 1996 . Convergence to equilibria for fluid models of FIFO queueing networks. Queue . Syst. 22 , 5 -- 45 . ]]Bramson, M. 1996. Convergence to equilibria for fluid models of FIFO queueing networks. Queue. Syst. 22, 5--45.","journal-title":"Syst."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/646461.693595"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/144179.144199"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.61110"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378588"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2003.821324"},{"volume-title":"Proceedings of IEEE INFOCOM, 1220--1230","author":"Elwalid A.","key":"e_1_2_1_15_1","unstructured":"]] Elwalid , A. , and Mitra , D . 1999. Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes . In Proceedings of IEEE INFOCOM, 1220--1230 . ]]Elwalid, A., and Mitra, D. 1999. Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes. In Proceedings of IEEE INFOCOM, 1220--1230."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796451"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.623149"},{"volume-title":"Proceedings of IEEE INFOCOM, 102--110","author":"Georgiadis L.","key":"e_1_2_1_18_1","unstructured":"]] Georgiadis , L. , Gu\u00e9rin , R. , Peris , V. , and Sivarajan , K . 1996. Efficient network QoS provisioning based on per node traffic shaping . In Proceedings of IEEE INFOCOM, 102--110 . ]]Georgiadis, L., Gu\u00e9rin, R., Peris, V., and Sivarajan, K. 1996. Efficient network QoS provisioning based on per node traffic shaping. In Proceedings of IEEE INFOCOM, 102--110."},{"key":"e_1_2_1_19_1","unstructured":"]]Koupoulos D. Nikoletseas N. and Spirakis P. 2001. The range of stability for heterogeneous and FIFO queueing networks. In Electronic Colloquium on Computational Complexity.  ]]Koupoulos D. Nikoletseas N. and Spirakis P. 2001. The range of stability for heterogeneous and FIFO queueing networks. In Electronic Colloquium on Computational Complexity."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.556345"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564904"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.298432"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/9.328805"},{"volume-title":"Proceedings of IEEE INFOCOM.","author":"Wrege D.","key":"e_1_2_1_25_1","unstructured":"]] Wrege , D. , and Liebeherr , J . 1997. A near-optimal packet scheduler for QoS networks . In Proceedings of IEEE INFOCOM. ]]Wrege, D., and Liebeherr, J. 1997. A near-optimal packet scheduler for QoS networks. In Proceedings of IEEE INFOCOM."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.469298"},{"volume-title":"Proceedings of the 9th International Conference on Network Protocols.","author":"Zhang Z.-L.","key":"e_1_2_1_27_1","unstructured":"]] Zhang , Z.-L. , Duan , Z. , and Hou , T . 2001. Fundamental tradeoffs in aggregate packet scheduling . In Proceedings of the 9th International Conference on Network Protocols. ]]Zhang, Z.-L., Duan, Z., and Hou, T. 2001. Fundamental tradeoffs in aggregate packet scheduling. In Proceedings of the 9th International Conference on Network Protocols."}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1541885.1541894","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1541885.1541894","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:01Z","timestamp":1750278361000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1541885.1541894"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["10.1145\/1541885.1541894"],"URL":"https:\/\/doi.org\/10.1145\/1541885.1541894","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"type":"print","value":"1549-6325"},{"type":"electronic","value":"1549-6333"}],"subject":[],"published":{"date-parts":[[2009,7]]},"assertion":[{"value":"2007-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-07-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}