{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:47Z","timestamp":1772164007645,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,8,17]],"date-time":"2015-08-17T00:00:00Z","timestamp":1439769600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,8,17]]},"DOI":"10.1145\/2785956.2787476","type":"proceedings-article","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T10:09:20Z","timestamp":1440410960000},"page":"449-463","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Condor"],"prefix":"10.1145","author":[{"given":"Brandon","family":"Schlinker","sequence":"first","affiliation":[{"name":"Google \/ University of Southern California, Los Angeles, CA, USA"}]},{"given":"Radhika Niranjan","family":"Mysore","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Sean","family":"Smith","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Jeffrey C.","family":"Mogul","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Amin","family":"Vahdat","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Minlan","family":"Yu","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA, USA"}]},{"given":"Ethan","family":"Katz-Bassett","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA, USA"}]},{"given":"Michael","family":"Rubin","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,8,17]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654101"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684464.2684505"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402967"},{"key":"e_1_3_2_2_4_1","unstructured":"A. Andreyev. Introducing data center fabric the next-generation Facebook data center network. http:\/\/bit.ly\/1zq5nsF 2014. A. Andreyev. Introducing data center fabric the next-generation Facebook data center network. http:\/\/bit.ly\/1zq5nsF 2014."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.95"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/647488.726978"},{"key":"e_1_3_2_2_7_1","unstructured":"Cisco Systems. Cisco's Massively Scalable Data Center. http:\/\/bit.ly\/1relWo8. Cisco Systems. Cisco's Massively Scalable Data Center. http:\/\/bit.ly\/1relWo8."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195470"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921168.1921187"},{"key":"e_1_3_2_2_10_1","unstructured":"B. Dieter and H. Dietz. A Web-Based Tool for Optimized Cluster Design. http:\/\/bit.ly\/1fyovAl 2007. B. Dieter and H. Dietz. A Web-Based Tool for Optimized Cluster Design. http:\/\/bit.ly\/1fyovAl 2007."},{"key":"e_1_3_2_2_12_1","first-page":"572","volume-title":"IJCAI","author":"Frost D.","year":"1995","unstructured":"D. Frost and R. Dechter . Look-ahead value ordering for constraint satisfaction problems . In IJCAI , pages 572 -- 578 , 1995 . D. Frost and R. Dechter. Look-ahead value ordering for constraint satisfaction problems. In IJCAI, pages 572--578, 1995."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018477"},{"key":"e_1_3_2_2_14_1","unstructured":"Google Inc. or-tools: the Google Operations Research Suite. https:\/\/code.google.com\/p\/or-tools\/. Google Inc. or-tools: the Google Operations Research Suite. https:\/\/code.google.com\/p\/or-tools\/."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592577"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402968"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.25080\/TCWV9851","volume-title":"SciPy","author":"Hagberg A. A.","year":"2008","unstructured":"A. A. Hagberg , D. A. Schult , and P. J. Swart . Exploring Network Structure, Dynamics, and Function using NetworkX . In SciPy , pages 11 -- 15 , Aug. 2008 . A. A. Hagberg, D. A. Schult, and P. J. Swart. Exploring Network Structure, Dynamics, and Function using NetworkX. In SciPy, pages 11--15, Aug. 2008."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177705047"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90040-0"},{"key":"e_1_3_2_2_20_1","volume-title":"Measuring and Understanding Throughput of Network Topologies. arXiv preprint 1402.2531","author":"Jyothi S. A.","year":"2014","unstructured":"S. A. Jyothi , A. Singla , B. Godfrey , and A. Kolla . Measuring and Understanding Throughput of Network Topologies. arXiv preprint 1402.2531 , 2014 . S. A. Jyothi, A. Singla, B. Godfrey, and A. Kolla. Measuring and Understanding Throughput of Network Topologies. arXiv preprint 1402.2531, 2014."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644918"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250679"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2287076.2287110"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486005"},{"key":"e_1_3_2_2_25_1","first-page":"399","volume-title":"NSDI","author":"Liu V.","year":"2013","unstructured":"V. Liu , D. Halperin , A. Krishnamurthy , and T. E. Anderson . F10: A Fault-Tolerant Engineered Network . In NSDI , pages 399 -- 412 , 2013 . V. Liu, D. Halperin, A. Krishnamurthy, and T. E. Anderson. F10: A Fault-Tolerant Engineered Network. In NSDI, pages 399--412, 2013."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626332"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1080\/03610918.2013.821482"},{"key":"e_1_3_2_2_28_1","volume-title":"Taming the Flying Cable Monster: A Topology Design and Optimization Framework for Data-Center Networks. In USENIX Annual Technical Conference","author":"Mudigonda J.","year":"2011","unstructured":"J. Mudigonda , P. Yalagandula , and J. C. Mogul . Taming the Flying Cable Monster: A Topology Design and Optimization Framework for Data-Center Networks. In USENIX Annual Technical Conference , 2011 . J. Mudigonda, P. Yalagandula, and J. C. Mogul. Taming the Flying Cable Monster: A Topology Design and Optimization Framework for Data-Center Networks. In USENIX Annual Technical Conference, 2011."},{"key":"e_1_3_2_2_29_1","first-page":"37","volume-title":"On Generalized Fat Trees. In Parallel Processing Symposium","author":"\u00d6hring S. R.","year":"1995","unstructured":"S. R. \u00d6hring , M. Ibel , S. K. Das , and M. J. Kumar . On Generalized Fat Trees. In Parallel Processing Symposium , pages 37 -- 44 . IEEE, 1995 . S. R. \u00d6hring, M. Ibel, S. K. Das, and M. J. Kumar. On Generalized Fat Trees. In Parallel Processing Symposium, pages 37--44. IEEE, 1995."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063462"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921168.1921189"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787508"},{"key":"e_1_3_2_2_33_1","first-page":"225","volume-title":"NSDI","author":"Singla A.","year":"2012","unstructured":"A. Singla , C.-Y. Hong , L. Popa , and P. B. Godfrey . Jellyfish: Networking Data Centers Randomly . In NSDI , pages 225 -- 238 , 2012 . A. Singla, C.-Y. Hong, L. Popa, and P. B. Godfrey. Jellyfish: Networking Data Centers Randomly. In NSDI, pages 225--238, 2012."},{"key":"e_1_3_2_2_34_1","volume-title":"arXiv preprint 1301.6179","author":"Solnushkin K. S.","year":"2013","unstructured":"K. S. Solnushkin . Automated Design of Two-Layer Fat-Tree Networks . arXiv preprint 1301.6179 , 2013 . K. S. Solnushkin. Automated Design of Two-Layer Fat-Tree Networks. arXiv preprint 1301.6179, 2013."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781118739853"},{"key":"e_1_3_2_2_36_1","volume-title":"Academic Press","author":"Tsang E.","year":"1993","unstructured":"E. Tsang . Foundations of Constraint Satisfaction, volume 289 . Academic Press , London , 1993 . E. Tsang. Foundations of Constraint Satisfaction, volume 289. Academic Press, London, 1993."},{"key":"e_1_3_2_2_37_1","unstructured":"A. Varga et al. The OMNeT A. Varga et al. The OMNeT"},{"key":"e_1_3_2_2_38_1","volume-title":"ESM2001","year":"2001","unstructured":"discrete event simulation system . In ESM2001 , 2001 . discrete event simulation system. In ESM2001, 2001."},{"key":"e_1_3_2_2_39_1","volume-title":"ESS97","author":"Varga A.","year":"1997","unstructured":"A. Varga and G. Pongor . Flexible topology description language for simulation programs . In ESS97 , 1997 . A. Varga and G. Pongor. Flexible topology description language for simulation programs. In ESS97, 1997."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2670518.2673885"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535383"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2012.25"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-1809.1936.tb02134.x"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2014.19"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592803"}],"event":{"name":"SIGCOMM '15: ACM SIGCOMM 2015 Conference","location":"London United Kingdom","acronym":"SIGCOMM '15","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2785956.2787476","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2785956.2787476","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:42:38Z","timestamp":1750210958000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2785956.2787476"}},"subtitle":["Better Topologies Through Declarative Design"],"short-title":[],"issued":{"date-parts":[[2015,8,17]]},"references-count":44,"alternative-id":["10.1145\/2785956.2787476","10.1145\/2785956"],"URL":"https:\/\/doi.org\/10.1145\/2785956.2787476","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2829988.2787476","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2015,8,17]]},"assertion":[{"value":"2015-08-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}