{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T20:24:19Z","timestamp":1789935859090,"version":"4.0.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,4,11]],"date-time":"2014-04-11T00:00:00Z","timestamp":1397174400000},"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":[[2014,6]]},"DOI":"10.1007\/s11134-014-9404-z","type":"journal-article","created":{"date-parts":[[2014,4,10]],"date-time":"2014-04-10T09:30:37Z","timestamp":1397122237000},"page":"243-273","source":"Crossref","is-referenced-by-count":4,"title":["Lingering issues in distributed scheduling"],"prefix":"10.1007","volume":"77","author":[{"given":"Florian","family":"Simatos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Niek","family":"Bouman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sem","family":"Borst","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,4,11]]},"reference":[{"issue":"3","key":"9404_CR1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1017\/S0269964812000058","volume":"26","author":"MAA Boon","year":"2012","unstructured":"Boon, M.A.A., Adan, I.J.B.F., Winands, E.M.M., Down, D.G.: Delays at signalized intersections with exhaustive traffic control. Probab. Eng. Inf. Sci. 26(3), 337\u2013373 (2012)","journal-title":"Probab. Eng. Inf. Sci."},{"key":"9404_CR2","doi-asserted-by":"crossref","unstructured":"Bouman, N., Borst, S., and Van Leeuwaarden, J.: Achievable delay performance in CSMA networks. In: Proceedings of Allerton Conference, pp. 384\u2013391 (2011)","DOI":"10.1109\/Allerton.2011.6120193"},{"key":"9404_CR3","doi-asserted-by":"crossref","unstructured":"Chaporkar, P., Sarkar, S.: Stable scheduling policies for maximizing throughput in generalized constrained queueing. In: Proceedings of Infocom (2006)","DOI":"10.1109\/INFOCOM.2006.267"},{"issue":"3","key":"9404_CR4","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1214\/aoap\/1177004701","volume":"5","author":"EG Coffman Jr","year":"1995","unstructured":"Coffman Jr, E.G., Puhalskii, A.A., Reiman, M.I.: Polling systems with zero switchover times: a heavy-traffic averaging principle. Ann. Appl. Probab. 5(3), 681\u2013719 (1995)","journal-title":"Ann. Appl. Probab."},{"key":"9404_CR5","doi-asserted-by":"crossref","unstructured":"Feuillet, M., Proutiere, A., Robert, P.: Random capture algorithms: fluid limits and stability. In: Proceedings of ITA Workshop (2010)","DOI":"10.1109\/ITA.2010.5454097"},{"key":"9404_CR6","doi-asserted-by":"crossref","first-page":"1773","DOI":"10.1214\/aoms\/1177693182","volume":"42","author":"JH Foster","year":"1971","unstructured":"Foster, J.H.: A limit theorem for a branching process with state-dependent immigration. Ann. Math. Stat. 42, 1773\u20131776 (1971)","journal-title":"Ann. Math. Stat."},{"key":"9404_CR7","unstructured":"Gamarnik, D., Zeevi, A.: Validity of heavy traffic steady-state approximation in generalized Jackson networks. Ann. Appl. Probab. 16(1), 56\u201390 (2006)"},{"key":"9404_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/1300000001","volume":"1","author":"L Georgiadis","year":"2006","unstructured":"Georgiadis, L., Neely, M.J., Tassiulas, L.: Resource allocation and cross-layer control in wireless networks. Found. Trends Netw. 1, 1\u2013144 (2006)","journal-title":"Found. Trends Netw."},{"key":"9404_CR9","doi-asserted-by":"crossref","unstructured":"Ghaderi, J., Borst, S.C., and Whiting, P.A.: Backlog-based random-access in wireless networks: fluid limits and instability issues. In: Proceedings of IEEE WiOpt Conference (2012)","DOI":"10.1109\/CISS.2012.6310763"},{"issue":"10","key":"9404_CR10","doi-asserted-by":"crossref","first-page":"6541","DOI":"10.1109\/TIT.2012.2204032","volume":"58","author":"L Jiang","year":"2012","unstructured":"Jiang, L., Leconte, M., Ni, J., Srikant, R., Walrand, J.: Fast mixing of parallel glauber dynamics and low-delay CSMA scheduling. IEEE Trans. Inf. Theory 58(10), 6541\u20136555 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9404_CR11","doi-asserted-by":"crossref","unstructured":"Jiang, L., and Walrand, J.: A distributed CSMA algorithm for throughput and utility maximization in wireless networks. In: Proceedings of Allerton Conference (2008)","DOI":"10.1109\/ALLERTON.2008.4797741"},{"issue":"1","key":"9404_CR12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s11134-012-9286-x","volume":"72","author":"L Jiang","year":"2012","unstructured":"Jiang, L., Walrand, J.: Stability and delay of distributed scheduling algorithms for networks of conflicting queues. Queueing Syst. 72(1), 161\u2013187 (2012)","journal-title":"Queueing Syst."},{"key":"9404_CR13","unstructured":"Jiang, L., Shah, D., Shin, J., Walrand, J.: Distributed random access algorithm: scheduling and congestion control. IEEE Trans. Inf. Theory 56(12), 6182\u20136207 (2010)"},{"key":"9404_CR14","doi-asserted-by":"crossref","unstructured":"Marbach, P., and Eryilmaz, A.: A backlog-based CSMA mechanism to achieve fairness and throughput-optimality in multihop wireless networks. In: Proceedings of Allerton Conference (2008)","DOI":"10.1109\/ALLERTON.2008.4797635"},{"key":"9404_CR15","doi-asserted-by":"crossref","unstructured":"Modiano, E., Shah, D., and Zussman, G.: Maximizing throughput in wireless networks via gossiping. In: Proceedings of ACM SIGMETRICS\/Performance Conference, pp. 27\u201338 (2006)","DOI":"10.1145\/1140103.1140283"},{"key":"9404_CR16","doi-asserted-by":"crossref","unstructured":"Ni, J., Tan, B., and Srikant, R.: Q-CSMA: queue length based CSMA\/CA algorithms for achieving maximum throughput and low delay in wireless networks. In: Proceedings of IEEE INFOCOM Mini-Conference (2010)","DOI":"10.1109\/INFCOM.2010.5462229"},{"key":"9404_CR17","doi-asserted-by":"crossref","unstructured":"Rajagopalan, S., Shah, D., and Shin, J.: Network adiabatic theorem: an efficient randomized protocol for content resolution. In: Proceedings of ACM SIGMETRICS\/Performance Conference, pp. 133\u2013144 (2009)","DOI":"10.1145\/1555349.1555365"},{"issue":"4","key":"9404_CR18","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF01149263","volume":"13","author":"JAC Resing","year":"1993","unstructured":"Resing, J.A.C.: Polling systems and multitype branching processes. Queueing Syst. Theory Appl. 13(4), 409\u2013426 (1993)","journal-title":"Queueing Syst. Theory Appl."},{"key":"9404_CR19","doi-asserted-by":"crossref","unstructured":"Shah, D., Shin, J., and Tetali, P.: Medium access using queues. In: Proceedings of IEEE FOCS, pp. 698\u2013707 (2011)","DOI":"10.1109\/FOCS.2011.99"},{"issue":"12","key":"9404_CR20","doi-asserted-by":"crossref","first-page":"7810","DOI":"10.1109\/TIT.2011.2168897","volume":"57","author":"D Shah","year":"2011","unstructured":"Shah, D., Tse, D.N.C., Tsitsiklis, J.N.: Hardness of low delay network scheduling. IEEE Trans. Inf. Theory 57(12), 7810\u20137817 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9404_CR21","unstructured":"Shah, D., Shin, J.: Randomized scheduling algorithm for queueing networks. Ann. Appl. Probab. 22(1), 128\u2013171 (2012)"},{"issue":"1","key":"9404_CR22","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1214\/11-AAP759","volume":"22","author":"D Shah","year":"2012","unstructured":"Shah, D., Wischik, D.: Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse. Ann. Appl. Probab. 22(1), 70\u2013127 (2012)","journal-title":"Ann. Appl. Probab."},{"key":"9404_CR23","doi-asserted-by":"crossref","unstructured":"Sharma, G., Mazumdar, R.R., and Shroff, N.B.: On the complexity of scheduling in wireless networks. In: Proceedings of MobiCom, pp. 227\u2013238 (2006)","DOI":"10.1145\/1161089.1161116"},{"key":"9404_CR24","doi-asserted-by":"crossref","unstructured":"Sharma, G., Shroff, N.B., Mazumdar, R.R.: Joint congestion control and distributed scheduling for throughput guarantees in wireless networks. In: Proceedings of Infocom (2007)","DOI":"10.1109\/INFCOM.2007.240"},{"key":"9404_CR25","doi-asserted-by":"crossref","unstructured":"Simatos, F., Bouman, N., and Borst, S.: Lingering issues in distributed scheduling. In: Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer, SIGMETRICS \u201913, pp. 141\u2013152, New York, NY, ACM (2013)","DOI":"10.1145\/2465529.2465758"},{"key":"9404_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aoap\/1075828046","volume":"14","author":"AL Stolyar","year":"2004","unstructured":"Stolyar, A.L.: Maxweight scheduling in a generalized switch: state space collapse and workload minimization in heavy traffic. Ann. Appl. Probab. 14, 1\u201353 (2004)","journal-title":"Ann. Appl. Probab."},{"key":"9404_CR27","doi-asserted-by":"crossref","unstructured":"Subramanian, V., and Alanyali, M.: Delay performance of CSMA in networks with bounded degree conflict graphs. In: Proceedings of IEEE ISIT, pp. 2373\u20132377 (2011)","DOI":"10.1109\/ISIT.2011.6033988"},{"key":"9404_CR28","doi-asserted-by":"crossref","unstructured":"Tassiulas, L.: Linear complexity algorithms for maximum throughput in radio networks and input queued switches. In: Proceedings of Infocom, pp. 533\u2013539 (1998)","DOI":"10.1109\/INFCOM.1998.665071"},{"key":"9404_CR29","doi-asserted-by":"crossref","first-page":"1936","DOI":"10.1109\/9.182479","volume":"37","author":"L Tassiulas","year":"1992","unstructured":"Tassiulas, L., Ephremides, A.: 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":"9404_CR30","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1109\/18.212277","volume":"39","author":"L Tassiulas","year":"1993","unstructured":"Tassiulas, L., Ephremides, A.: Dynamic server allocation to parallel queues with randomly varying connectivity. IEEE Trans. Inf. Theory 39, 466\u2013478 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9404_CR31","doi-asserted-by":"crossref","unstructured":"Wu, X., Srikant, R.: Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks. In: Proceedings of Infocom (2006)","DOI":"10.1109\/INFOCOM.2006.176"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-014-9404-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-014-9404-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-014-9404-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T09:57:34Z","timestamp":1746179854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-014-9404-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,11]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["9404"],"URL":"https:\/\/doi.org\/10.1007\/s11134-014-9404-z","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,11]]}}}