{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T07:59:01Z","timestamp":1709279941532},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2011,6,30]],"date-time":"2011-06-30T00:00:00Z","timestamp":1309392000000},"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,8]]},"DOI":"10.1007\/s11134-011-9234-1","type":"journal-article","created":{"date-parts":[[2011,6,29]],"date-time":"2011-06-29T22:01:47Z","timestamp":1309384907000},"page":"375-384","source":"Crossref","is-referenced-by-count":22,"title":["Optimal scaling of average queue sizes in an input-queued switch: an open problem"],"prefix":"10.1007","volume":"68","author":[{"given":"Devavrat","family":"Shah","sequence":"first","affiliation":[]},{"given":"John N.","family":"Tsitsiklis","sequence":"additional","affiliation":[]},{"given":"Yuan","family":"Zhong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,30]]},"reference":[{"key":"9234_CR1","first-page":"147","volume":"5","author":"G. Birkhoff","year":"1946","unstructured":"Birkhoff, G.: Tres observaciones sobre el algebra lineal. Univ. Nac. Tucum\u00e1n. Rev, Ser. A 5, 147\u2013151 (1946)","journal-title":"Univ. Nac. Tucum\u00e1n. Rev, Ser. A"},{"issue":"5","key":"9234_CR2","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/18.21215","volume":"34","author":"B. Hajek","year":"1988","unstructured":"Hajek, B., Sasaki, G.: Link scheduling in polynomial time. IEEE Trans. Inf. Theory 34(5), 910\u2013917 (1988)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9234_CR3","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1214\/aoap\/1019737665","volume":"10","author":"J. Michael Harrison","year":"2000","unstructured":"Harrison, J. Michael: Brownian models of open processing networks: canonical representation of workload. Ann. Appl. Probab. 10, 75\u2013103 (2000)","journal-title":"Ann. Appl. Probab."},{"key":"9234_CR4","first-page":"296","volume-title":"Proceedings of IEEE Infocom","author":"N. McKeown","year":"1996","unstructured":"McKeown, N., Anantharam, V., Walrand, J.: Achieving 100% throughput in an input-queued switch. In: Proceedings of IEEE Infocom, pp. 296\u2013302 (1996)"},{"key":"9234_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-3267-7","volume-title":"Markov Chains and Stochastic Stability","author":"S.P. Meyn","year":"1993","unstructured":"Meyn, S.P., Tweedie, R.L.: Markov Chains and Stochastic Stability. Springer, New York (1993)"},{"key":"9234_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"9234_CR7","doi-asserted-by":"crossref","unstructured":"Neely, M., Modiano, E., Cheng, Y.-S.: Logarithmic delay for n\u00d7n packet switches under the cross-bar constraint. IEEE\/ACM Trans. Netw. 15(3) (2007)","DOI":"10.1109\/TNET.2007.893876"},{"key":"9234_CR8","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1239\/jap\/1231340224","volume":"45","author":"D. Shah","year":"2008","unstructured":"Shah, D., Tsitsiklis, J.N.: Bin packing with queues. J. Appl. Probab. 45, 922\u2013939 (2008)","journal-title":"J. Appl. Probab."},{"key":"9234_CR9","volume-title":"Proceedings of IEEE Infocom","author":"D. Shah","year":"2006","unstructured":"Shah, D., Wischik, D.J.: Optimal scheduling algorithms for input-queued switches. In: Proceedings of IEEE Infocom (2006)"},{"key":"9234_CR10","doi-asserted-by":"crossref","unstructured":"Shah, D., Wischik, D.J.: 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":"9234_CR11","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 queuing 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":"9234_CR12","first-page":"5","volume":"2","author":"J. Neumann von","year":"1953","unstructured":"von Neumann, J.: A certain zero-sum two-person game equivalent to the optimal assignment problem. Contrib. Theory Games 2, 5\u201312 (1953)","journal-title":"Contrib. Theory Games"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-011-9234-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-011-9234-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-9234-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T14:37:01Z","timestamp":1560350221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-011-9234-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,30]]},"references-count":12,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["9234"],"URL":"https:\/\/doi.org\/10.1007\/s11134-011-9234-1","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,30]]}}}