{"id":"https://openalex.org/W2745518244","doi":"https://doi.org/10.1109/tpds.2017.2741492","title":"Random Regular Graph and Generalized De Bruijn Graph with $k$ -Shortest Path Routing","display_name":"Random Regular Graph and Generalized De Bruijn Graph with $k$ -Shortest Path Routing","publication_year":2017,"publication_date":"2017-08-18","ids":{"openalex":"https://openalex.org/W2745518244","doi":"https://doi.org/10.1109/tpds.2017.2741492","mag":"2745518244"},"language":"en","primary_location":{"id":"doi:10.1109/tpds.2017.2741492","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2017.2741492","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/A5047669299","display_name":"Peyman Faizian","orcid":"https://orcid.org/0000-0001-9493-766X"},"institutions":[{"id":"https://openalex.org/I103163165","display_name":"Florida State University","ror":"https://ror.org/05g3dte14","country_code":"US","type":"education","lineage":["https://openalex.org/I103163165"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Peyman Faizian","raw_affiliation_strings":["Department of Computer Science, Florida State University, Tallahassee, FL"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Florida State University, Tallahassee, FL","institution_ids":["https://openalex.org/I103163165"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006905591","display_name":"Md Atiqul Mollah","orcid":"https://orcid.org/0000-0002-2789-0846"},"institutions":[{"id":"https://openalex.org/I103163165","display_name":"Florida State University","ror":"https://ror.org/05g3dte14","country_code":"US","type":"education","lineage":["https://openalex.org/I103163165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Md Atiqul Mollah","raw_affiliation_strings":["Department of Computer Science, Florida State University, Tallahassee, FL"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Florida State University, Tallahassee, FL","institution_ids":["https://openalex.org/I103163165"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049765501","display_name":"Xin Yuan","orcid":"https://orcid.org/0000-0002-9167-1613"},"institutions":[{"id":"https://openalex.org/I103163165","display_name":"Florida State University","ror":"https://ror.org/05g3dte14","country_code":"US","type":"education","lineage":["https://openalex.org/I103163165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xin Yuan","raw_affiliation_strings":["Department of Computer Science, Florida State University, Tallahassee, FL"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Florida State University, Tallahassee, FL","institution_ids":["https://openalex.org/I103163165"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000474094","display_name":"Zaid Alzaid","orcid":"https://orcid.org/0000-0002-6208-6140"},"institutions":[{"id":"https://openalex.org/I103163165","display_name":"Florida State University","ror":"https://ror.org/05g3dte14","country_code":"US","type":"education","lineage":["https://openalex.org/I103163165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zaid Alzaid","raw_affiliation_strings":["Department of Computer Science, Florida State University, Tallahassee, FL"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Florida State University, Tallahassee, FL","institution_ids":["https://openalex.org/I103163165"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060855642","display_name":"Scott Pakin","orcid":"https://orcid.org/0000-0002-5220-1985"},"institutions":[{"id":"https://openalex.org/I1343871089","display_name":"Los Alamos National Laboratory","ror":"https://ror.org/01e41cf67","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1343871089","https://openalex.org/I198811213","https://openalex.org/I4210120050"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Scott Pakin","raw_affiliation_strings":["Computer, Computational, and Statistical Sciences, Los Alamos National Laboratory, Los Alamos, NM"],"affiliations":[{"raw_affiliation_string":"Computer, Computational, and Statistical Sciences, Los Alamos National Laboratory, Los Alamos, NM","institution_ids":["https://openalex.org/I1343871089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078475557","display_name":"Michael Lang","orcid":"https://orcid.org/0000-0002-3498-6352"},"institutions":[{"id":"https://openalex.org/I1343871089","display_name":"Los Alamos National Laboratory","ror":"https://ror.org/01e41cf67","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1343871089","https://openalex.org/I198811213","https://openalex.org/I4210120050"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Lang","raw_affiliation_strings":["Computer, Computational, and Statistical Sciences, Los Alamos National Laboratory, Los Alamos, NM"],"affiliations":[{"raw_affiliation_string":"Computer, Computational, and Statistical Sciences, Los Alamos National Laboratory, Los Alamos, NM","institution_ids":["https://openalex.org/I1343871089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5047669299"],"corresponding_institution_ids":["https://openalex.org/I103163165"],"apc_list":null,"apc_paid":null,"fwci":1.5327,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.85464815,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"29","issue":"1","first_page":"144","last_page":"155"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"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":1.0,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7378678321838379},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.6879543662071228},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6528982520103455},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5880221128463745},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5549679398536682},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.5399565100669861},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.43775051832199097},{"id":"https://openalex.org/keywords/de-bruijn-sequence","display_name":"De Bruijn sequence","score":0.4288586378097534},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3708849549293518},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.36940526962280273},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3529391288757324},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32383936643600464},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3174777030944824},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31235116720199585},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.2768724858760834},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24534660577774048},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.20007750391960144},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.18171298503875732}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7378678321838379},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.6879543662071228},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6528982520103455},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5880221128463745},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5549679398536682},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.5399565100669861},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.43775051832199097},{"id":"https://openalex.org/C170320093","wikidata":"https://www.wikidata.org/wiki/Q1953457","display_name":"De Bruijn sequence","level":2,"score":0.4288586378097534},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3708849549293518},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.36940526962280273},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3529391288757324},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32383936643600464},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3174777030944824},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31235116720199585},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.2768724858760834},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24534660577774048},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.20007750391960144},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.18171298503875732}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tpds.2017.2741492","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2017.2741492","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":[],"funders":[{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320332359","display_name":"Office of Science","ror":"https://ror.org/00mmn6b08"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1548164611","https://openalex.org/W1903496173","https://openalex.org/W1963600265","https://openalex.org/W1993216347","https://openalex.org/W2018775903","https://openalex.org/W2038423000","https://openalex.org/W2040232420","https://openalex.org/W2063999066","https://openalex.org/W2076508739","https://openalex.org/W2113933854","https://openalex.org/W2118231264","https://openalex.org/W2129437643","https://openalex.org/W2151709073","https://openalex.org/W2155187164","https://openalex.org/W2163769126","https://openalex.org/W2592570088","https://openalex.org/W2949666640","https://openalex.org/W3147460469","https://openalex.org/W4252071697","https://openalex.org/W4297816311","https://openalex.org/W6682220054","https://openalex.org/W6684402220"],"related_works":["https://openalex.org/W2357391150","https://openalex.org/W2018146256","https://openalex.org/W2392001488","https://openalex.org/W2161960576","https://openalex.org/W2353596372","https://openalex.org/W2170980056","https://openalex.org/W2348504720","https://openalex.org/W2388051136","https://openalex.org/W2388893052","https://openalex.org/W1488188326"],"abstract_inverted_index":{"The":[0,80],"Random":[1],"regular":[2,30],"graph":[3,31],"(RRG)":[4],"has":[5],"recently":[6],"been":[7],"proposed":[8],"as":[9],"an":[10,84],"interconnect":[11],"topology":[12],"for":[13,56,115,155],"future":[14],"large":[15],"scale":[16],"data":[17],"centers":[18],"and":[19,38,47,64,73,97,112,132,145,151],"HPC":[20],"clusters.":[21],"An":[22],"RRG":[23,85],"is":[24,36,90,121],"a":[25,65,109,119,136],"special":[26],"case":[27],"of":[28,45,95,126,153],"directed":[29],"(DRG)":[32],"where":[33],"each":[34],"link":[35],"unidirectional":[37],"all":[39],"nodes":[40],"have":[41],"the":[42,103,149],"same":[43],"number":[44],"incoming":[46],"outgoing":[48],"links.":[49],"In":[50],"this":[51],"work,":[52],"we":[53,142],"establish":[54],"bounds":[55,76],"DRGs":[57],"on":[58],"diameter,":[59,127],"average":[60,128],"k-shortest":[61,70,87,129,137],"path":[62,71,88,130,138],"length,":[63,131],"load":[66,98,133],"balancing":[67,134],"property":[68],"with":[69,86,135,162],"routing,":[72],"use":[74,143],"these":[75],"to":[77,147],"evaluate":[78],"RRGs.":[79],"results":[81],"indicate":[82],"that":[83,114],"routing":[89,139],"not":[91],"ideal":[92],"in":[93,124],"terms":[94,125],"diameter":[96],"balancing.":[99],"We":[100],"further":[101],"consider":[102],"Generalized":[104],"De":[105],"Bruijn":[106],"Graph":[107],"(GDBG),":[108],"deterministic":[110],"DRG,":[111],"prove":[113],"most":[116],"network":[117],"configurations,":[118],"GDBG":[120],"near":[122],"optimal":[123],"scheme.":[140],"Finally,":[141],"modeling":[144],"simulation":[146],"exploit":[148],"strengths":[150],"weaknesses":[152],"RRGs":[154,161],"different":[156],"traffic":[157],"conditions":[158],"by":[159],"comparing":[160],"GDBGs.":[163]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}