{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T05:23:38Z","timestamp":1773638618150,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,7,20]],"date-time":"2011-07-20T00:00:00Z","timestamp":1311120000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s11134-011-9250-1","type":"journal-article","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T22:34:08Z","timestamp":1311028448000},"page":"121-143","source":"Crossref","is-referenced-by-count":28,"title":["Fluid models of congestion collapse in overloaded switched networks"],"prefix":"10.1007","volume":"69","author":[{"given":"Devavrat","family":"Shah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damon","family":"Wischik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,7,20]]},"reference":[{"key":"9250_CR1","volume-title":"Proceedings of ACM Sigmetrics","author":"T. Bonald","year":"2001","unstructured":"Bonald,\u00a0T., Massoulie,\u00a0L.: Impact of fairness on Internet performance. In: Proceedings of ACM Sigmetrics (2001)"},{"key":"9250_CR2","unstructured":"Chan, C.W., Armony,\u00a0M., Bambos,\u00a0N.: Fairness in overloaded parallel queues. Personal communication (2011)"},{"key":"9250_CR3","doi-asserted-by":"crossref","unstructured":"Dai, J.G., Lin,\u00a0W.: Maximum pressure policies in stochastic processing networks. Oper. Res. 53(2) (2005)","DOI":"10.1287\/opre.1040.0170"},{"key":"9250_CR4","doi-asserted-by":"crossref","unstructured":"Dai, J.G., Lin,\u00a0W.: Asymptotic optimality of maximum pressure policies in stochastic processing networks. Ann. Appl. Probab. 18(6) (2008)","DOI":"10.1214\/08-AAP522"},{"key":"9250_CR5","first-page":"556","volume-title":"Proceedings of IEEE Infocom","author":"J.G. Dai","year":"2000","unstructured":"Dai, J.G., Prabhakar,\u00a0B.: The throughput of switches with and without speed-up. In: Proceedings of IEEE Infocom, pp. 556\u2013564 (2000)"},{"key":"9250_CR6","doi-asserted-by":"crossref","first-page":"978","DOI":"10.1016\/j.peva.2007.06.024","volume":"64","author":"R. Egorova","year":"2007","unstructured":"Egorova,\u00a0R., Borst,\u00a0S., Zwart,\u00a0B.: Bandwidth-sharing networks in overload. Perform. Eval. 64, 978\u2013993 (2007)","journal-title":"Perform. Eval."},{"issue":"6","key":"9250_CR7","doi-asserted-by":"crossref","first-page":"2684","DOI":"10.1109\/TIT.2006.874401","volume":"52","author":"L. Georgiadis","year":"2006","unstructured":"Georgiadis,\u00a0L., Tassiulas,\u00a0L.: Optimal overload response in sensor networks. IEEE Trans. Inf. Theory 52(6), 2684\u20132696 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9250_CR8","doi-asserted-by":"crossref","unstructured":"Gromoll, H.C., Williams, R.J.: Fluid limits for networks with bandwidth sharing and general document size distributions. Ann. Appl. Probab. 19(1) (2009)","DOI":"10.1214\/08-AAP541"},{"key":"9250_CR9","doi-asserted-by":"crossref","unstructured":"Harrison, J.M., Zeevi,\u00a0A.: A method for staffing large call centers based on stochastic fluid models. Manuf. Serv. Oper. Manag. (2005)","DOI":"10.1287\/msom.1040.0052"},{"key":"9250_CR10","volume-title":"Proceedings of SIGCOMM","author":"V. Jacobson","year":"1988","unstructured":"Jacobson,\u00a0V.: Congestion avoidance and control. In: Proceedings of SIGCOMM (1988)"},{"key":"9250_CR11","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1214\/105051604000000224","volume":"14","author":"F.P. Kelly","year":"2004","unstructured":"Kelly, F.P., Williams, R.J.: Fluid model for a network operating under a fair bandwidth-sharing policy. Ann. Appl. Probab. 14, 1055\u20131083 (2004)","journal-title":"Ann. Appl. Probab."},{"key":"9250_CR12","volume-title":"IEEE Symposium on Network Computing and Applications","author":"F. Klemm","year":"2006","unstructured":"Klemm,\u00a0F., Boudec, J.Y.L., Aberer,\u00a0K.: Congestion control for distributed hash tables. In: IEEE Symposium on Network Computing and Applications. http:\/\/doi.ieeecomputersociety.org\/10.1109\/NCA.2006.19 (2006)"},{"issue":"5","key":"9250_CR13","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1109\/90.879343","volume":"8","author":"J. Mo","year":"2000","unstructured":"Mo,\u00a0J., Walrand,\u00a0J.: Fair end-to-end windows-based congestion control. IEEE\/ACM Trans. Netw. 8(5), 556\u2013567 (2000)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9250_CR14","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1023\/A:1019138827659","volume":"15","author":"J. Roberts","year":"2000","unstructured":"Roberts,\u00a0J., Massoulie,\u00a0L.: Bandwidth sharing and admission control for elastic traffic. Telecommun. Syst. 15, 185\u2013201 (2000)","journal-title":"Telecommun. Syst."},{"key":"9250_CR15","doi-asserted-by":"crossref","unstructured":"Shah,\u00a0D., Wischik,\u00a0D.: Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse. Ann. Appl. Probab. (2011, to appear)","DOI":"10.1214\/11-AAP759"},{"key":"9250_CR16","doi-asserted-by":"crossref","first-page":"1936","DOI":"10.1109\/9.182479","volume":"37","author":"L. Tassiulas","year":"1992","unstructured":"Tassiulas,\u00a0L., Ephremides,\u00a0A.: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Autom. Control 37, 1936\u20131948 (1992)","journal-title":"IEEE Trans. Autom. Control"},{"key":"9250_CR17","volume-title":"Proceedings of Allerton","author":"V.J. Venkataramanan","year":"2007","unstructured":"Venkataramanan, V.J., Lin,\u00a0X.: Structural properties of LDP for queue-length based wireless scheduling algorithms. In: Proceedings of Allerton (2007)"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-011-9250-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-011-9250-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-011-9250-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T03:21:08Z","timestamp":1560396068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-011-9250-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,20]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9250"],"URL":"https:\/\/doi.org\/10.1007\/s11134-011-9250-1","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,20]]}}}