{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:32:18Z","timestamp":1772724738655,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,12,6]],"date-time":"2017-12-06T00:00:00Z","timestamp":1512518400000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["420\/12"],"award-info":[{"award-number":["420\/12"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1464239, 1535887"],"award-info":[{"award-number":["1464239, 1535887"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005386","name":"Israeli Centers for Research Excellence","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005386","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,12,6]]},"DOI":"10.1145\/2999572.2999580","type":"proceedings-article","created":{"date-parts":[[2016,11,29]],"date-time":"2016-11-29T11:28:42Z","timestamp":1480418922000},"page":"205-219","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":73,"title":["Xpander"],"prefix":"10.1145","author":[{"given":"Asaf","family":"Valadarsky","sequence":"first","affiliation":[{"name":"The Hebrew University of Jerusalem, Jerusalem, Israel"}]},{"given":"Gal","family":"Shahaf","sequence":"additional","affiliation":[{"name":"The Hebrew University of Jerusalem, Jerusalem, Israel"}]},{"given":"Michael","family":"Dinitz","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, USA"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[{"name":"The Hebrew University of Jerusalem, Jersualem, Israel"}]}],"member":"320","published-online":{"date-parts":[[2016,12,6]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"IBM ILOG CPLEX Optimizer. http:\/\/www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/index.html."},{"key":"e_1_3_2_1_2_1","unstructured":"MPTCP Simulator v0.2. http:\/\/nets.cs.pub.ro\/~costin\/code.html."},{"key":"e_1_3_2_1_3_1","unstructured":"Ocean cluster for experimental architectures in networks (ocean). http:\/\/ocean.cs.illinois.edu\/."},{"key":"e_1_3_2_1_4_1","unstructured":"RipL-POX simple datacenter controller build on RipL. https:\/\/github.com\/brandonheller\/riplpox."},{"key":"e_1_3_2_1_5_1","unstructured":"Xpander Project Page. http:\/\/husant.github.io\/Xpander."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402967"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855711.1855730"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.34"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-006-0029-7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(88)80014-3"},{"key":"e_1_3_2_1_11_1","unstructured":"C. Paasch S. Barre et al. Multipath TCP in the Linux Kernel. http:\/\/www.multipath-tcp.org."},{"key":"e_1_3_2_1_12_1","volume-title":"A lower bound on the average shortest path length in regular graphs. Networks","author":"Cerf V. G.","year":"1974","unstructured":"Cerf, V. G., Cowan, D. D., Mullin, R. C., and Stanton, R. G. A lower bound on the average shortest path length in regular graphs. Networks (1974)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPAN.1994.367163"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58429-3_38"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921168.1921187"},{"key":"e_1_3_2_1_16_1","volume-title":"A new implementation of yen's ranking loopless paths algorithm. 4OR","author":"Queir\u00f3s Vieira~Martins E.","year":"2003","unstructured":"de~Queir\u00f3s Vieira~Martins, E., and Pascoal, M. M. B. A new implementation of yen's ranking loopless paths algorithm. 4OR (2003)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-03-11812-8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1090\/memo\/0910"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1676021"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018477"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592577"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402968"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Hoory S. Linial N. and Wigderson A. Expander graphs and their applications. Bull. Amer. Math. Soc. (2006).","DOI":"10.1090\/S0273-0979-06-01126-8"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591971.2592040"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868447.1868466"},{"key":"e_1_3_2_1_28_1","volume-title":"The geometry of graphs and some of its algorithmic applications. Combinatorica","author":"Linial N.","year":"1995","unstructured":"Linial, N., London, E., and Rabinovich, Y. The geometry of graphs and some of its algorithmic applications. Combinatorica (1995)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/2482626.2482665"},{"key":"e_1_3_2_1_30_1","volume-title":"Ramanujan graphs. Combinatorica","author":"Lubotzky A.","year":"1988","unstructured":"Lubotzky, A., Phillips, R., and Sarnak, P. Ramanujan graphs. Combinatorica (1988)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.63"},{"key":"e_1_3_2_1_32_1","volume-title":"Explicit constructions of expanders. Problemy Pereda\\v ci Informacii","author":"Margulis G. A.","year":"1973","unstructured":"Margulis, G. A. Explicit constructions of expanders. Problemy Pereda\\v ci Informacii (1973)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1998.1828"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855711.1855729"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592575"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777421"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.78"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Paturi R. Lu D.-T. Ford J. E. Esener S. C. and Lee S. H. Parallel algorithms based on expander graphs for optical computing. Appl. Opt. (1991).","DOI":"10.1364\/AO.30.000917"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921168.1921189"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796583"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC3031"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2038916.2038918"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787508"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/2616448.2616452"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/2228298.2228322"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/147508.147517"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2834050.2834059"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/1972457.1972468"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658943"},{"key":"e_1_3_2_1_51_1","volume-title":"Finding the k shortest loopless paths in a network. Management Science","author":"Yen J. Y.","year":"1971","unstructured":"Yen, J. Y. Finding the k shortest loopless paths in a network. Management Science (1971)."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095797"}],"event":{"name":"CoNEXT '16: The 12th International Conference on emerging Networking EXperiments and Technologies","location":"Irvine California USA","acronym":"CoNEXT '16","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 12th International on Conference on emerging Networking EXperiments and Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2999572.2999580","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2999572.2999580","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2999572.2999580","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:36:11Z","timestamp":1763458571000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2999572.2999580"}},"subtitle":["Towards Optimal-Performance Datacenters"],"short-title":[],"issued":{"date-parts":[[2016,12,6]]},"references-count":52,"alternative-id":["10.1145\/2999572.2999580","10.1145\/2999572"],"URL":"https:\/\/doi.org\/10.1145\/2999572.2999580","relation":{},"subject":[],"published":{"date-parts":[[2016,12,6]]},"assertion":[{"value":"2016-12-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}