{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:48:07Z","timestamp":1783036087659,"version":"3.54.6"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2017,9,21]],"date-time":"2017-09-21T00:00:00Z","timestamp":1505952000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,9,21]],"date-time":"2017-09-21T00:00:00Z","timestamp":1505952000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1409106"],"award-info":[{"award-number":["CCF-1409106"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NeTS-1718270"],"award-info":[{"award-number":["NeTS-1718270"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s11134-017-9546-x","type":"journal-article","created":{"date-parts":[[2017,9,21]],"date-time":"2017-09-21T11:34:53Z","timestamp":1505993693000},"page":"311-347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Costly circuits, submodular schedules and approximate Carath\u00e9odory Theorems"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7355-634X","authenticated-orcid":false,"given":"Shaileshh","family":"Bojja Venkatakrishnan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad","family":"Alizadeh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pramod","family":"Viswanath","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,9,21]]},"reference":[{"key":"9546_CR1","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall (1993). https:\/\/books.google.com\/books?id=WnZRAAAAMAAJ"},{"key":"9546_CR2","first-page":"19","volume":"10","author":"M Al-Fares","year":"2010","unstructured":"Al-Fares, M., Radhakrishnan, S., Raghavan, B., Huang, N., Vahdat, A.: Hedera: dynamic flow scheduling for data center networks. NSDI 10, 19\u201319 (2010)","journal-title":"NSDI"},{"key":"9546_CR3","doi-asserted-by":"crossref","unstructured":"Alizadeh, M., Greenberg, A., Maltz, D.A., Padhye, J., Patel, P., Prabhakar, B., Sengupta, S., Sridharan, M.: Data center TCP (DCTCP). In: SIGCOMM (2011)","DOI":"10.1145\/1851182.1851192"},{"issue":"1","key":"9546_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1), 121\u2013164 (2012)","journal-title":"Theory Comput."},{"key":"9546_CR5","doi-asserted-by":"crossref","unstructured":"Azar, Y., Gamzu, I.: Efficient submodular function maximization under linear packing constraints. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) Automata, Languages, and Programming, pp. 38\u201350. Springer, Berlin, Heidelberg (2012)","DOI":"10.1007\/978-3-642-31594-7_4"},{"key":"9546_CR6","doi-asserted-by":"crossref","unstructured":"Barman, S.: Approximating Nash equilibria and dense bipartite subgraphs via an approximate version of Carath\u00e9odory\u2019s theorem. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, pp. 361\u2013369. ACM (2015)","DOI":"10.1145\/2746539.2746566"},{"issue":"2","key":"9546_CR7","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1287\/trsc.27.2.102","volume":"27","author":"C Barnhart","year":"1993","unstructured":"Barnhart, C., Sheffi, Y.: A network-based primal-dual heuristic for the solution of multicommodity network flow problems. Transp. Sci. 27(2), 102\u2013117 (1993)","journal-title":"Transp. Sci."},{"key":"9546_CR8","doi-asserted-by":"crossref","unstructured":"Benson, T., Akella, A., Maltz, D.A.: Network traffic characteristics of data centers in the wild. In: SIGCOMM (2010)","DOI":"10.1145\/1879141.1879175"},{"issue":"2","key":"9546_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01581104","volume":"81","author":"D Bienstock","year":"1998","unstructured":"Bienstock, D., Chopra, S., G\u00fcnl\u00fck, O., Tsai, C.Y.: Minimum cost capacity installation for multicommodity network flows. Math. Program. 81(2), 177\u2013199 (1998)","journal-title":"Math. Program."},{"key":"9546_CR10","doi-asserted-by":"crossref","unstructured":"Cao, Z., Kodialam, M., Lakshman, T.: Joint static and dynamic traffic scheduling in data center networks. In: INFOCOM (2014)","DOI":"10.1109\/INFOCOM.2014.6848190"},{"key":"9546_CR11","unstructured":"Chang, C.S., Chen, W.J., Huang, H.Y.: Birkhoff\u2013von Neumann input buffered crossbar switches. In: INFOCOM (2000)"},{"key":"9546_CR12","unstructured":"Chang, C.S., Lee, D.S., Jou, Y.S.: Load balanced Birkhoff\u2013von Neumann switches. In: 2001 IEEE Workshop on High Performance Switching and Routing, pp. 276\u2013280. IEEE (2001)"},{"issue":"3","key":"9546_CR13","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1109\/90.779217","volume":"7","author":"A Dasylva","year":"1999","unstructured":"Dasylva, A., Srikant, R.: Optimal wdm schedules for optical star networks. IEEE\/ACM Trans. Netw. (TON) 7(3), 446\u2013456 (1999)","journal-title":"IEEE\/ACM Trans. Netw. (TON)"},{"issue":"1","key":"9546_CR14","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/2529989","volume":"61","author":"R Duan","year":"2014","unstructured":"Duan, R., Pettie, S.: Linear-time approximation for maximum weight matching. J. ACM 61(1), 1:1\u20131:23 (2014). doi: 10.1145\/2529989","journal-title":"J. ACM"},{"key":"9546_CR15","doi-asserted-by":"crossref","unstructured":"Duan, R., Su, H.H.: A scaling algorithm for maximum weight matching in bipartite graphs. In: SODA (2012)","DOI":"10.1137\/1.9781611973099.111"},{"key":"9546_CR16","doi-asserted-by":"crossref","unstructured":"Farrington, N.: Optics in data center network architecture. Ph.D. thesis, Citeseer (2012)","DOI":"10.1109\/OIC.2013.6552917"},{"key":"9546_CR17","doi-asserted-by":"crossref","unstructured":"Farrington, N., Porter, G., Radhakrishnan, S., Bazzaz, H.H., Subramanya, V., Fainman, Y., Papen, G., Vahdat, A.: Helios: a hybrid electrical\/optical switch architecture for modular data centers. In: SIGCOMM (2011)","DOI":"10.1145\/1851182.1851223"},{"issue":"4","key":"9546_CR18","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TPAMI.2010.135","volume":"33","author":"PF Felzenszwalb","year":"2011","unstructured":"Felzenszwalb, P.F., Zabih, R.: Dynamic programming and graph algorithms in computer vision. IEEE Trans. Pattern Anal. Mach. Intell. 33(4), 721\u2013740 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"9546_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1590\/S0101-74382013005000004","volume":"33","author":"RPM Ferreira","year":"2013","unstructured":"Ferreira, R.P.M., Luna, H.P.L., Mahey, P., Souza, M.C.D.: Global optimization of capacity expansion and flow assignment in multicommodity networks. Pesquisa Operacional 33(2), 217\u2013234 (2013)","journal-title":"Pesquisa Operacional"},{"issue":"4","key":"9546_CR20","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/S0895480199355754","volume":"13","author":"LK Fleischer","year":"2000","unstructured":"Fleischer, L.K.: Approximating fractional multicommodity flow independent of the number of commodities. SIAM J. Discrete Math. 13(4), 505\u2013520 (2000)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"9546_CR21","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM (JACM) 34(3), 596\u2013615 (1987)","journal-title":"J. ACM (JACM)"},{"key":"9546_CR22","unstructured":"Fu, S., Wu, B., Jiang, X., Pattavina, A., Zhang, L., Xu, S.: Cost and delay tradeoff in three-stage switch architecture for data center networks. In: HPSR (2013)"},{"issue":"2","key":"9546_CR23","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1137\/S0097539704446232","volume":"37","author":"N Garg","year":"2007","unstructured":"Garg, N., Koenemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM J. Comput. 37(2), 630\u2013652 (2007)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9546_CR24","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1109\/JSAC.2003.810496","volume":"21","author":"P Giaccone","year":"2003","unstructured":"Giaccone, P., Prabhakar, B., Shah, D.: Randomized scheduling algorithms for high-aggregate bandwidth switches. IEEE J. Sel. Areas Commun. 21(4), 546\u2013559 (2003)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"6","key":"9546_CR25","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1109\/TCOM.1985.1096336","volume":"33","author":"IS Gopal","year":"1985","unstructured":"Gopal, I.S., Wong, C.K.: Minimizing the number of switchings in an SS\/TDMA system. IEEE Trans. Commun. 33(6), 497\u2013501 (1985)","journal-title":"IEEE Trans. Commun."},{"key":"9546_CR26","doi-asserted-by":"crossref","unstructured":"Greenberg, A., Lahiri, P., Maltz, D.A., Patel, P., Sengupta, S.: Towards a next generation data center architecture: scalability and commoditization. In: Proceedings of the ACM Workshop on Programmable Routers for Extensible Services of Tomorrow, pp. 57\u201362. ACM (2008)","DOI":"10.1145\/1397718.1397732"},{"issue":"2","key":"9546_CR27","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"9546_CR28","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics. Springer (1993). https:\/\/books.google.com\/books?id=agLvAAAAMAAJ"},{"key":"9546_CR29","doi-asserted-by":"crossref","unstructured":"Hamedazimi, N., Qazi, Z., Gupta, H., Sekar, V., Das, S.R., Longtin, J.P., Shah, H., Tanwer, A.: Firefly: a reconfigurable wireless data center fabric using free-space optics. In: SIGCOMM (2014)","DOI":"10.1145\/2619239.2626328"},{"issue":"4","key":"9546_CR30","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S Hoory","year":"2006","unstructured":"Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Am. Math. Soc. 43(4), 439\u2013561 (2006)","journal-title":"Bull. Am. Math. Soc."},{"issue":"10","key":"9546_CR31","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1109\/TCOM.1979.1094297","volume":"27","author":"T Inukai","year":"1979","unstructured":"Inukai, T.: An efficient SS\/TDMA time slot assignment algorithm. IEEE Trans. Commun. 27(10), 1449\u20131455 (1979)","journal-title":"IEEE Trans. Commun."},{"key":"9546_CR32","unstructured":"Kandula, S., Padhye, J., Bahl, P.: Flyways to de-congest data center networks. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) Springer, Berlin, Heidelberg (2009)"},{"key":"9546_CR33","unstructured":"Keslassy, I., Chang, C.S., McKeown, N., Lee, D.S.: Optimal load-balancing. In: INFOCOM (2005). https:\/\/www.microsoft.com\/en-us\/research\/publication\/flyways-to-de-congest-data-center-networks\/"},{"key":"9546_CR34","doi-asserted-by":"crossref","unstructured":"Keslassy, I., Kodialam, M., Lakshman, T., Stiliadis, D.: On guaranteed smooth scheduling for input-queued switches. In: INFOCOM (2003)","DOI":"10.1109\/INFCOM.2003.1208974"},{"issue":"10","key":"9546_CR35","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1109\/LCOMM.2003.817330","volume":"7","author":"I Keslassy","year":"2003","unstructured":"Keslassy, I., Zhang-Shen, R., McKeown, N.: Maximum size matching is unstable for any packet switch. IEEE Commun. Lett. 7(10), 496\u2013498 (2003)","journal-title":"IEEE Commun. Lett."},{"issue":"2","key":"9546_CR36","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jcss.1995.1020","volume":"50","author":"T Leighton","year":"1995","unstructured":"Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, \u00c9., Tragoudas, S.: Fast approximation algorithms for multicommodity flow problems. J. Comput. Syst. Sci. 50(2), 228\u2013243 (1995)","journal-title":"J. Comput. Syst. Sci."},{"issue":"7","key":"9546_CR37","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1109\/JSAC.2003.815843","volume":"21","author":"X Li","year":"2003","unstructured":"Li, X., Hamdi, M.: On scheduling optical packet switches with reconfiguration delay. IEEE J. Sel. Areas Commun. 21(7), 1156\u20131164 (2003)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9546_CR38","unstructured":"Li, Y., Panwar, S., Chao, H.J.: Frame-based matching algorithms for optical switches. In: 2003 HPSR Workshop on High Performance Switching and Routing, pp. 97\u2013102. IEEE (2003)"},{"key":"9546_CR39","unstructured":"Liu, H., Lu, F., Forencich, A., Kapoor, R., Tewari, M., Voelker, G.M., Papen, G., Snoeren, A.C., Porter, G.: Circuit switching under the radar with reactor. In: NSDI (2014)"},{"key":"9546_CR40","doi-asserted-by":"crossref","unstructured":"Liu, H., Mukerjee, M.K., Li, C., Feltman, N., Papen, G., Savage, S., Seshan, S., Voelker, G.M., Andersen, D.G., Kaminsky, M., Porter, G., Snoeren, A.C.: Scheduling techniques for hybrid circuit\/packet networks. In: ACM CoNEXT (2015)","DOI":"10.1145\/2716281.2836126"},{"issue":"2","key":"9546_CR41","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1023\/A:1011280023547","volume":"20","author":"P Mahey","year":"2001","unstructured":"Mahey, P., Benchakroun, A., Boyer, F.: Capacity and flow assignment of data networks by generalized benders decomposition. J. Global Optim. 20(2), 169\u2013189 (2001)","journal-title":"J. Global Optim."},{"issue":"2","key":"9546_CR42","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/90.769767","volume":"7","author":"N McKeown","year":"1999","unstructured":"McKeown, N.: The iSLIP scheduling algorithm for input-queued switches. IEEE\/ACM Trans. Netw. 7(2), 188\u2013201 (1999)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"8","key":"9546_CR43","doi-asserted-by":"publisher","first-page":"1260","DOI":"10.1109\/26.780463","volume":"47","author":"N McKeown","year":"1999","unstructured":"McKeown, N., Mekkittikul, A., Anantharam, V., Walrand, J.: Achieving 100% throughput in an input-queued switch. IEEE Trans. Commun. 47(8), 1260\u20131267 (1999)","journal-title":"IEEE Trans. Commun."},{"key":"9546_CR44","unstructured":"Mekkittikul, A., McKeown, N.: A practical scheduling algorithm to achieve 100% throughput in input-queued switches. In: INFOCOM (1998)"},{"key":"9546_CR45","unstructured":"Mirrokni, V., Leme, R.P., Vladu, A., Wong, S.C.W.: Tight bounds for approximate Carath\u00e9odory and beyond. arXiv preprint arXiv:1512.08602 (2015)"},{"issue":"6","key":"9546_CR46","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.ipl.2004.05.007","volume":"91","author":"S Pettie","year":"2004","unstructured":"Pettie, S., Sanders, P.: A simpler linear time 2\/3-$$\\varepsilon $$ approximation for maximum weight matching. Inf. Process. Lett. 91(6), 271\u2013276 (2004)","journal-title":"Inf. Process. Lett."},{"key":"9546_CR47","unstructured":"Pinsker, M.S.: On the complexity of a concentrator. In: 7th International Telegraffic Conference, Vol.\u00a04, pp. 1\u2013318. Citeseer (1973)"},{"key":"9546_CR48","doi-asserted-by":"crossref","unstructured":"Porter, G., Strong, R., Farrington, N., Forencich, A., Chen-Sun, P., Rosing, T., Fainman, Y., Papen, G., Vahdat, A.: Integrating microsecond circuit switching into the data center. In: SIGCOMM (2013)","DOI":"10.1145\/2486001.2486007"},{"issue":"12","key":"9546_CR49","doi-asserted-by":"publisher","first-page":"1909","DOI":"10.1016\/S0005-1098(99)00129-6","volume":"35","author":"B Prabhakar","year":"1999","unstructured":"Prabhakar, B., McKeown, N.: On the speedup required for combined input-and output-queued switching. Automatica 35(12), 1909\u20131920 (1999)","journal-title":"Automatica"},{"issue":"2","key":"9546_CR50","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/62044.62050","volume":"36","author":"MO Rabin","year":"1989","unstructured":"Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM (JACM) 36(2), 335\u2013348 (1989)","journal-title":"J. ACM (JACM)"},{"key":"9546_CR51","doi-asserted-by":"crossref","unstructured":"Roy, A., Zeng, H., Bagga, J., Porter, G., Snoeren, A.C.: Inside the social network\u2019s (datacenter) network. In: SIGCOMM (2015)","DOI":"10.1145\/2785956.2787472"},{"key":"9546_CR52","volume-title":"Combinatorial Optimization\u2014Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization\u2014Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"9546_CR53","unstructured":"Shieh, A., Kandula, S., Greenberg, A.G., Kim, C.: Seawall: performance isolation for cloud datacenter networks. In: HotCloud (2010)"},{"key":"9546_CR54","unstructured":"Singla, A., Singh, A., Chen, Y.: OSA: an optical switching architecture for data center networks with unprecedented flexibility. In: NSDI (2012)"},{"key":"9546_CR55","volume-title":"Communication Networks: An Optimization, Control and Stochastic Networks Perspective","author":"R Srikant","year":"2014","unstructured":"Srikant, R., Ying, L.: Communication Networks: An Optimization, Control and Stochastic Networks Perspective. Cambridge University Press, New York, NY (2014)"},{"issue":"5","key":"9546_CR56","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1109\/TNET.2003.818190","volume":"11","author":"B Towles","year":"2003","unstructured":"Towles, B., Dally, W.J.: Guaranteed scheduling for switches with configuration overhead. IEEE\/ACM Trans. Netw. 11(5), 835\u2013847 (2003)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"8","key":"9546_CR57","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33(8), 103\u2013111 (1990)","journal-title":"Commun. ACM"},{"key":"9546_CR58","doi-asserted-by":"crossref","unstructured":"Wang, C.H., Javidi, T.: Adaptive policies for scheduling with reconfiguration delay: an end-to-end solution for all-optical data centers. ArXiv preprint arXiv:1511.03417 (2015)","DOI":"10.1109\/INFOCOM.2015.7218406"},{"key":"9546_CR59","doi-asserted-by":"crossref","unstructured":"Wang, C.H., Javidi, T., Porter, G.: End-to-end scheduling for all-optical data centers. In: 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 406\u2013414. IEEE (2015)","DOI":"10.1109\/INFOCOM.2015.7218406"},{"key":"9546_CR60","doi-asserted-by":"crossref","unstructured":"Wang, G., Andersen, D.G., Kaminsky, M., Papagiannaki, K., Ng, T., Kozuch, M., Ryan, M.: c-through: part-time optics in data centers. In: SIGCOMM (2011)","DOI":"10.1145\/1851182.1851222"},{"key":"9546_CR61","doi-asserted-by":"crossref","unstructured":"Wu, B., Yeung, K.L.: Nxg05-6: minimum delay scheduling in scalable hybrid electronic\/optical packet switches. In: GLOBECOM (2006)","DOI":"10.1109\/GLOCOM.2006.346"},{"key":"9546_CR62","doi-asserted-by":"crossref","unstructured":"Wu, B., Yeung, K.L., Wang, X.: Nxg06-4: improving scheduling efficiency for high-speed routers with optical switch fabrics. In: GLOBECOM (2006)","DOI":"10.1109\/GLOCOM.2006.350"},{"key":"9546_CR63","doi-asserted-by":"crossref","unstructured":"Zhou, X., Zhang, Z., Zhu, Y., Li, Y., Kumar, S., Vahdat, A., Zhao, B.Y., Zheng, H.: Mirror mirror on the ceiling: flexible wireless links for data centers. In: SIGCOMM (2012)","DOI":"10.1145\/2342356.2342440"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-017-9546-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-017-9546-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-017-9546-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T04:19:15Z","timestamp":1659500355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-017-9546-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,21]]},"references-count":63,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["9546"],"URL":"https:\/\/doi.org\/10.1007\/s11134-017-9546-x","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,21]]},"assertion":[{"value":"12 September 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}