{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:53Z","timestamp":1763468273570,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,11,16]],"date-time":"2015-11-16T00:00:00Z","timestamp":1447632000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/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\/501100005386","name":"Israeli Centers for Research Excellence","doi-asserted-by":"publisher","award":["I-CORE ALGO"],"award-info":[{"award-number":["I-CORE ALGO"]}],"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":[[2015,11,16]]},"DOI":"10.1145\/2834050.2834059","type":"proceedings-article","created":{"date-parts":[[2015,11,9]],"date-time":"2015-11-09T16:29:04Z","timestamp":1447086544000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Xpander"],"prefix":"10.1145","author":[{"given":"Asaf","family":"Valadarsky","sequence":"first","affiliation":[{"name":"The Hebrew University of Jerusalem"}]},{"given":"Michael","family":"Dinitz","sequence":"additional","affiliation":[{"name":"Johns Hopkins University"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[{"name":"The Hebrew University of Jerusalem"}]}],"member":"320","published-online":{"date-parts":[[2015,11,16]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"C. Paasch S. Barre et al. Multipath TCP in the Linux Kernel. http:\/\/www.multipath-tcp.org.  C. Paasch S. Barre et al. Multipath TCP in the Linux Kernel. http:\/\/www.multipath-tcp.org."},{"key":"e_1_3_2_2_2_1","unstructured":"MPTCP Simulator v0.2. http:\/\/nets.cs.pub.ro\/~costin\/code.html.  MPTCP Simulator v0.2. http:\/\/nets.cs.pub.ro\/~costin\/code.html."},{"key":"e_1_3_2_2_3_1","unstructured":"RipL-POX simple datacenter controller build on RipL. https:\/\/github.com\/brandonheller\/riplpox.  RipL-POX simple datacenter controller build on RipL. https:\/\/github.com\/brandonheller\/riplpox."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402967"},{"key":"e_1_3_2_2_5_1","volume-title":"NSDI","author":"Al-Fares M.","year":"2010","unstructured":"Al-Fares , M. , Radhakrishnan , S. , Raghavan , B. , Huang , N. , and Vahdat , A . Hedera: Dynamic flow scheduling for data center networks . In NSDI ( 2010 ). Al-Fares, M., Radhakrishnan, S., Raghavan, B., Huang, N., and Vahdat, A. Hedera: Dynamic flow scheduling for data center networks. In NSDI (2010)."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.34"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-006-0029-7"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(88)80014-3"},{"key":"e_1_3_2_2_9_1","volume-title":"Building a better butterfly: the multiplexed metabutterfly. ISPAN","author":"Chong F. T.","year":"1994","unstructured":"Chong , F. T. , Brewer , E. A. , Leighton , F. T. , and Knight , T. F., J. Building a better butterfly: the multiplexed metabutterfly. ISPAN ( 1994 ). Chong, F. T., Brewer, E. A., Leighton, F. T., and Knight, T. F., J. Building a better butterfly: the multiplexed metabutterfly. ISPAN (1994)."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58429-3_38"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921168.1921187"},{"key":"e_1_3_2_2_12_1","volume-title":"A new implementation of yen's ranking loopless paths algorithm. 4OR","author":"de 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 ). 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_2_13_1","doi-asserted-by":"publisher","DOI":"10.1090\/memo\/0910"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1676021"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018477"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592577"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402968"},{"key":"e_1_3_2_2_19_1","volume-title":"Expander graphs and their applications. Bull. Amer. Math. Soc. (N.S","author":"Hoory S.","year":"2006","unstructured":"Hoory , S. , Linial , N. , and Wigderson , A . Expander graphs and their applications. Bull. Amer. Math. Soc. (N.S ( 2006 ). Hoory, S., Linial, N., and Wigderson, A. Expander graphs and their applications. Bull. Amer. Math. Soc. (N.S (2006)."},{"key":"e_1_3_2_2_20_1","volume-title":"Measuring and understanding throughput of network topologies. CoRR","author":"Jyothi S. A.","year":"2014","unstructured":"Jyothi , S. A. , Singla , A. , Godfrey , B. , and Kolla , A . Measuring and understanding throughput of network topologies. CoRR ( 2014 ). Jyothi, S. A., Singla, A., Godfrey, B., and Kolla, A. Measuring and understanding throughput of network topologies. CoRR (2014)."},{"key":"e_1_3_2_2_21_1","unstructured":"Lantz B. Heller B. and McKeown N. A network in a laptop: Rapid prototyping for software-defined networks. ACM.  Lantz B. Heller B. and McKeown N. A network in a laptop: Rapid prototyping for software-defined networks. ACM."},{"key":"e_1_3_2_2_22_1","unstructured":"Liu V. Halperin D. Krishnamurthy A. and Anderson T. F10: A fault-tolerant engineered network. NSDI.   Liu V. Halperin D. Krishnamurthy A. and Anderson T. F10: A fault-tolerant engineered network. NSDI."},{"key":"e_1_3_2_2_23_1","volume-title":"Ramanujan graphs. Combinatorica","author":"Lubotzky A.","year":"1988","unstructured":"Lubotzky , A. , Phillips , R. , and Sarnak , P . Ramanujan graphs. Combinatorica ( 1988 ). Lubotzky, A., Phillips, R., and Sarnak, P. Ramanujan graphs. Combinatorica (1988)."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"e_1_3_2_2_25_1","unstructured":"Mudigonda J. Yalagandula P. Al-Fares M. and Mogul J. C. Spain: Cots data-center ethernet for multipathing over arbitrary topologies.  Mudigonda J. Yalagandula P. Al-Fares M. and Mogul J. C. Spain: Cots data-center ethernet for multipathing over arbitrary topologies."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592575"},{"key":"e_1_3_2_2_27_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).  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_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921168.1921189"},{"key":"e_1_3_2_2_29_1","first-page":"3031","author":"Rosen E.","year":"2001","unstructured":"Rosen , E. , Viswanathan , A. , and Callon , R. Multiprotocol Label Switching Architecture. RFC 3031 , 2001 . Rosen, E., Viswanathan, A., and Callon, R. Multiprotocol Label Switching Architecture. RFC 3031, 2001.","journal-title":"Multiprotocol Label Switching Architecture. RFC"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2038916.2038918"},{"key":"e_1_3_2_2_31_1","volume-title":"NSDI","author":"Singla A.","year":"2014","unstructured":"Singla , A. , Godfrey , P. B. , and Kolla , A . High throughput data center topology design . In NSDI ( 2014 ). Singla, A., Godfrey, P. B., and Kolla, A. High throughput data center topology design. In NSDI (2014)."},{"key":"e_1_3_2_2_32_1","volume-title":"NSDI","author":"Singla A.","year":"2012","unstructured":"Singla , A. , Hong , C.-Y. , Popa , L. , and Godfrey , P. B . Jellyfish: Networking data centers randomly . In NSDI ( 2012 ). Singla, A., Hong, C.-Y., Popa, L., and Godfrey, P. B. Jellyfish: Networking data centers randomly. In NSDI (2012)."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/147508.147517"},{"key":"e_1_3_2_2_34_1","volume-title":"NSDI","author":"Wischik D.","year":"2011","unstructured":"Wischik , D. , Raiciu , C. , Greenhalgh , A. , and Handley , M . Design, implementation and evaluation of congestion control for multipath TCP . In NSDI ( 2011 ). Wischik, D., Raiciu, C., Greenhalgh, A., and Handley, M. Design, implementation and evaluation of congestion control for multipath TCP. In NSDI (2011)."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658943"},{"key":"e_1_3_2_2_36_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 ). Yen, J. Y. Finding the k shortest loopless paths in a network. Management Science (1971)."}],"event":{"name":"HotNets-XIV: The 14th ACM Workshop on Hot Topics in Networks","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","CISCO"],"location":"Philadelphia PA USA","acronym":"HotNets-XIV"},"container-title":["Proceedings of the 14th ACM Workshop on Hot Topics in Networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2834050.2834059","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2834050.2834059","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:43:17Z","timestamp":1750225397000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2834050.2834059"}},"subtitle":["Unveiling the Secrets of High-Performance Datacenters"],"short-title":[],"issued":{"date-parts":[[2015,11,16]]},"references-count":36,"alternative-id":["10.1145\/2834050.2834059","10.1145\/2834050"],"URL":"https:\/\/doi.org\/10.1145\/2834050.2834059","relation":{},"subject":[],"published":{"date-parts":[[2015,11,16]]},"assertion":[{"value":"2015-11-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}