{"id":"https://openalex.org/W2525451563","doi":"https://doi.org/10.1109/tpds.2016.2613043","title":"Distributed Shortcut Networks: Low-Latency Low-Degree Non-Random Topologies Targeting the Diameter and Cable Length Trade-Off","display_name":"Distributed Shortcut Networks: Low-Latency Low-Degree Non-Random Topologies Targeting the Diameter and Cable Length Trade-Off","publication_year":2016,"publication_date":"2016-09-26","ids":{"openalex":"https://openalex.org/W2525451563","doi":"https://doi.org/10.1109/tpds.2016.2613043","mag":"2525451563"},"language":"en","primary_location":{"id":"doi:10.1109/tpds.2016.2613043","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2016.2613043","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081826794","display_name":"Truong Thao Nguyen","orcid":"https://orcid.org/0000-0003-3641-374X"},"institutions":[{"id":"https://openalex.org/I200475212","display_name":"The Graduate University for Advanced Studies, SOKENDAI","ror":"https://ror.org/0516ah480","country_code":"JP","type":"education","lineage":["https://openalex.org/I200475212"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Nguyen T. Truong","raw_affiliation_strings":["Graduate University for Advanced Studies (SOKENDAI), Hayama, Kanagawa Prefecture, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate University for Advanced Studies (SOKENDAI), Hayama, Kanagawa Prefecture, Japan","institution_ids":["https://openalex.org/I200475212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070369823","display_name":"Ikki Fujiwara","orcid":"https://orcid.org/0000-0001-6841-5243"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ikki Fujiwara","raw_affiliation_strings":["National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029236003","display_name":"Michihiro Koibuchi","orcid":"https://orcid.org/0000-0002-5790-6992"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]},{"id":"https://openalex.org/I200475212","display_name":"The Graduate University for Advanced Studies, SOKENDAI","ror":"https://ror.org/0516ah480","country_code":"JP","type":"education","lineage":["https://openalex.org/I200475212"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Michihiro Koibuchi","raw_affiliation_strings":["Graduate University for Advanced Studies (SOKENDAI), Hayama, Kanagawa Prefecture, Japan","National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate University for Advanced Studies (SOKENDAI), Hayama, Kanagawa Prefecture, Japan","institution_ids":["https://openalex.org/I200475212"]},{"raw_affiliation_string":"National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033964491","display_name":"Khanh-Van Nguyen","orcid":"https://orcid.org/0000-0002-3009-3135"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Khanh-Van Nguyen","raw_affiliation_strings":["Ha Noi University of Science and Technology, 1 Dai Co Viet Road, Ha Noi, Viet Nam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ha Noi University of Science and Technology, 1 Dai Co Viet Road, Ha Noi, Viet Nam","institution_ids":["https://openalex.org/I94518387"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":1.1499,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.84649208,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"28","issue":"4","first_page":"989","last_page":"1001"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.7850959300994873},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7260725498199463},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.5863102674484253},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.5669951438903809},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.539045512676239},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.490658164024353},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.46961623430252075},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4166007936000824},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.37178903818130493},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.34265509247779846},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.33355259895324707},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24529415369033813},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.19591417908668518},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1744878590106964},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.13259372115135193},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12580737471580505}],"concepts":[{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.7850959300994873},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7260725498199463},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.5863102674484253},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.5669951438903809},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.539045512676239},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.490658164024353},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.46961623430252075},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4166007936000824},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.37178903818130493},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.34265509247779846},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33355259895324707},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24529415369033813},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.19591417908668518},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1744878590106964},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.13259372115135193},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12580737471580505},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tpds.2016.2613043","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2016.2613043","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6559367697","display_name":"A Study on Approximate-Computing Networks","funder_award_id":"16H02816","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320309618","display_name":"Ministry of Science and Technology","ror":"https://ror.org/02b207r52"},{"id":"https://openalex.org/F4320320907","display_name":"Japan Science and Technology Corporation","ror":"https://ror.org/00097mb19"},{"id":"https://openalex.org/F4320323843","display_name":"Ministry of Information and Communication","ror":null},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"},{"id":"https://openalex.org/F4320338075","display_name":"Core Research for Evolutional Science and Technology","ror":"https://ror.org/00097mb19"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1567404193","https://openalex.org/W1968177179","https://openalex.org/W1995597621","https://openalex.org/W2025177582","https://openalex.org/W2036663731","https://openalex.org/W2038423000","https://openalex.org/W2049644498","https://openalex.org/W2058971918","https://openalex.org/W2066139250","https://openalex.org/W2083649025","https://openalex.org/W2112090702","https://openalex.org/W2112121929","https://openalex.org/W2113933854","https://openalex.org/W2119541875","https://openalex.org/W2128678576","https://openalex.org/W2155187164","https://openalex.org/W2158049821","https://openalex.org/W2163769126","https://openalex.org/W2303746389","https://openalex.org/W3145732157","https://openalex.org/W3147460469","https://openalex.org/W4249851962","https://openalex.org/W4297816311","https://openalex.org/W6660116253","https://openalex.org/W6671562562","https://openalex.org/W6684402220"],"related_works":["https://openalex.org/W2161995522","https://openalex.org/W2353596372","https://openalex.org/W2996337372","https://openalex.org/W2898676476","https://openalex.org/W2359578922","https://openalex.org/W2524661126","https://openalex.org/W2388051136","https://openalex.org/W2357391150","https://openalex.org/W2371371223","https://openalex.org/W2030338218"],"abstract_inverted_index":{"Low":[0],"communication":[1,65,259,265],"latency":[2,66,231],"becomes":[3],"a":[4,56,79,120,132,189],"main":[5,114],"concern":[6],"in":[7,35,67],"highly":[8],"parallel":[9],"computers":[10],"and":[11,32,71,166,183],"supercomputers":[12],"that":[13,60,76,98,125,146,159,207,248,256],"reach":[14],"millions":[15],"of":[16,37,122,150,178,188,208,218],"processing":[17],"cores.":[18],"Random":[19],"network":[20,111],"topologies":[21,45,97],"are":[22,173,184],"better":[23,175],"suited":[24],"to":[25,47,117,186,215,227],"achieve":[26],"low":[27,33,164,167,216],"average":[28,168,195,201],"shortest":[29,169],"path":[30,170],"length":[31,54,135,203],"diameter":[34,128,165],"terms":[36],"the":[38,100,127,148,151,179,193,209,233],"hop":[39],"counts":[40],"between":[41],"nodes.":[42],"However,":[43],"random":[44,110,190,211],"lead":[46],"two":[48],"problems:":[49],"(1)":[50],"increased":[51],"aggregate":[52],"cable":[53,134,202],"on":[55,237],"machine":[57],"room":[58],"floor":[59],"would":[61],"become":[62],"dominant":[63],"for":[64,136,254],"next-generation":[68],"custom":[69,144,222,235],"supercomputers,":[70],"(2)":[72],"high":[73],"routing":[74,80,145,223],"complexity":[75],"typically":[77],"requires":[78],"table":[81],"at":[82],"each":[83],"node":[84],"(e.g.,":[85],"topology-agnostic":[86],"deadlock-free":[87],"routing).":[88],"In":[89],"this":[90],"context,":[91],"we":[92],"first":[93],"propose":[94,143],"low-degree":[95],"non-random":[96],"exploit":[99],"small-world":[101],"effect,":[102],"which":[103,172,213],"has":[104,163,200],"been":[105],"well":[106],"modeled":[107],"by":[108],"some":[109],"models.":[112],"Our":[113,154,221,241],"idea":[115],"is":[116,252],"carefully":[118],"design":[119],"set":[121],"various-length":[123,152],"shortcuts":[124],"keep":[126],"small":[129],"while":[130],"maintaining":[131],"short":[133],"economical":[137],"passive":[138],"electric":[139],"cables.":[140],"We":[141],"also":[142],"uses":[147],"regularity":[149],"shortcuts.":[153],"experimental":[155],"graph":[156],"analyses":[157],"show":[158,247],"our":[160,249],"proposed":[161,198,250],"topology":[162,191,199,251],"length,":[171],"considerably":[174],"than":[176,206,232],"those":[177,187],"counterpart":[180,210,239],"3-D":[181],"torus":[182],"near":[185],"with":[192],"same":[194],"degree.":[196],"The":[197],"drastically":[204],"shorter":[205],"topology,":[212],"leads":[214],"cost":[217],"interconnection":[219],"networks.":[220],"takes":[224],"non-minimal":[225],"paths":[226],"provide":[228],"lower":[229],"zero-load":[230],"minimal":[234],"routings":[236],"different":[238],"topologies.":[240],"discrete-event":[242],"simulation":[243],"results":[244],"using":[245],"SimGrid":[246],"suitable":[253],"applications":[255],"have":[257],"irregular":[258],"patterns":[260],"or":[261],"non-nearest":[262],"neighbor":[263],"collective":[264],"patterns.":[266]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}