{"id":"https://openalex.org/W1593858492","doi":"https://doi.org/10.1109/iscas.2003.1205158","title":"Wormhole routing in de Bruijn networks and hyper-de Bruijn networks","display_name":"Wormhole routing in de Bruijn networks and hyper-de Bruijn networks","publication_year":2003,"publication_date":"2003-11-21","ids":{"openalex":"https://openalex.org/W1593858492","doi":"https://doi.org/10.1109/iscas.2003.1205158","mag":"1593858492"},"language":"en","primary_location":{"id":"doi:10.1109/iscas.2003.1205158","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2003.1205158","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03.","raw_type":"proceedings-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/A5053767707","display_name":"Elaiyasuriyan Ganesan","orcid":"https://orcid.org/0000-0001-6952-9111"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"E. Ganesan","raw_affiliation_strings":["Fore Minds Corporation, Palo Alto, CA, USA","ForeMinds Corp., Palo Alto, CA, USA"],"affiliations":[{"raw_affiliation_string":"Fore Minds Corporation, Palo Alto, CA, USA","institution_ids":[]},{"raw_affiliation_string":"ForeMinds Corp., Palo Alto, CA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113458314","display_name":"Dhiraj K. Pradhan","orcid":null},"institutions":[{"id":"https://openalex.org/I2801520950","display_name":"At Bristol","ror":"https://ror.org/039fp5n52","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I2801520950"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"D.K. Pradhan","raw_affiliation_strings":["Department of Computer Science, Bristol, UK","[Department of Computer Science, Bristol, UK]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Bristol, UK","institution_ids":["https://openalex.org/I2801520950"]},{"raw_affiliation_string":"[Department of Computer Science, Bristol, UK]","institution_ids":["https://openalex.org/I2801520950"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053767707"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10246442,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"III","last_page":"870"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9807999730110168,"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.9807999730110168,"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/T11342","display_name":"Carbon and Quantum Dots Applications","score":0.9621000289916992,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9617999792098999,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/de-bruijn-sequence","display_name":"De Bruijn sequence","score":0.8987625241279602},{"id":"https://openalex.org/keywords/de-bruijn-graph","display_name":"De Bruijn graph","score":0.8335226774215698},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.6209487318992615},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5876302123069763},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5513253211975098},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.4883534610271454},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.43982675671577454},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3821164667606354},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3477233648300171},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3404952585697174},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3301161527633667},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.27056020498275757},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2668195366859436},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2560933232307434}],"concepts":[{"id":"https://openalex.org/C170320093","wikidata":"https://www.wikidata.org/wiki/Q1953457","display_name":"De Bruijn sequence","level":2,"score":0.8987625241279602},{"id":"https://openalex.org/C20218877","wikidata":"https://www.wikidata.org/wiki/Q3066095","display_name":"De Bruijn graph","level":3,"score":0.8335226774215698},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.6209487318992615},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5876302123069763},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5513253211975098},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.4883534610271454},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.43982675671577454},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3821164667606354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3477233648300171},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3404952585697174},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3301161527633667},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.27056020498275757},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2668195366859436},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2560933232307434}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1109/iscas.2003.1205158","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2003.1205158","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.161.8933","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.8933","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bris.ac.uk/Publications/Papers/2000300.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.6.1804","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.1804","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bris.ac.uk/~pradhan/DownloadPapers/INVITED_ISCAS03.pdf","raw_type":"text"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/e0fea193-9af1-4226-9f77-f1c3a23748bb","is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/e0fea193-9af1-4226-9f77-f1c3a23748bb","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Ganesan, E & Pradhan, D 2003, Wormhole routing in de Bruijn networks and hyper-de Bruijn networks. in Unknown. Institute of Electrical and Electronics Engineers (IEEE). < http://www.cs.bris.ac.uk/Publications/pub_info.jsp?id=2000300 >","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/e0fea193-9af1-4226-9f77-f1c3a23748bb","is_oa":false,"landing_page_url":"http://hdl.handle.net/1983/e0fea193-9af1-4226-9f77-f1c3a23748bb","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Ganesan, E & Pradhan, D 2003, Wormhole routing in de Bruijn networks and hyper-de Bruijn networks. in Unknown. Institute of Electrical and Electronics Engineers (IEEE). < http://www.cs.bris.ac.uk/Publications/pub_info.jsp?id=2000300 >","raw_type":"contributionToPeriodical"},{"id":"mag:1593858492","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W113343429","https://openalex.org/W1829285233","https://openalex.org/W1971305860","https://openalex.org/W2024759612","https://openalex.org/W2046805643","https://openalex.org/W2096030487","https://openalex.org/W2114122721","https://openalex.org/W2119807697","https://openalex.org/W2134376893","https://openalex.org/W2154323564","https://openalex.org/W2155388085","https://openalex.org/W2156677140","https://openalex.org/W2165021839","https://openalex.org/W4235172414","https://openalex.org/W6684143461","https://openalex.org/W6792259007"],"related_works":["https://openalex.org/W1977833815","https://openalex.org/W2170588519","https://openalex.org/W2074884878","https://openalex.org/W2057149515","https://openalex.org/W3010755262","https://openalex.org/W2115781127","https://openalex.org/W1826357218","https://openalex.org/W2370468629","https://openalex.org/W2290193273","https://openalex.org/W2189588026","https://openalex.org/W2269023415","https://openalex.org/W1505190132","https://openalex.org/W1010980885","https://openalex.org/W2115471557","https://openalex.org/W2070956409","https://openalex.org/W297985730","https://openalex.org/W1978822173","https://openalex.org/W299242902","https://openalex.org/W2059416361","https://openalex.org/W2410583980"],"abstract_inverted_index":{"The":[0,22,111],"order-(m,":[1],"n)":[2,7],"hyper-de":[3,23,73,153],"Bruijn":[4,20,24,71,74,81,154],"graph":[5,25],"HD(m,":[6],"is":[8],"the":[9,35,121,152,158],"direct":[10],"product":[11],"of":[12,30,37,113],"an":[13,17,77],"order-m":[14],"hypercube":[15],"and":[16,34,49,55,72,104,134],"order-n":[18],"de":[19,70,80],"graph.":[21],"offers":[26],"flexibility":[27],"in":[28,68],"terms":[29],"connections":[31],"per":[32,108],"node":[33],"level":[36],"fault-tolerance.":[38],"These":[39,89],"networks":[40],"as":[41],"well":[42],"possess":[43],"logarithmic":[44],"diameter,":[45],"simple":[46],"routing":[47,67,85,149],"algorithms":[48,86,90,123,150],"support":[50],"many":[51],"computationally":[52],"important":[53],"subgraphs":[54],"admit":[56],"efficient":[57],"implementation.":[58],"In":[59],"this":[60],"paper,":[61],"we":[62],"present":[63,141],"results":[64],"on":[65,157],"wormhole":[66,148],"binary":[69,79],"networks.":[75],"For":[76],"N-node":[78],"network,":[82],"four":[83],"deadlock-free":[84,147],"are":[87,124],"presented.":[88],"use":[91],"log":[92,96,101,137],"N,":[93,127,130,138],"/spl":[94,99,125,128,131,135],"lceil/2/3":[95],"N/spl":[97,102],"rceil/,":[98],"lceil/1/2":[100],"rceil/":[103],"4":[105],"virtual":[106],"channels":[107],"physical":[109],"channel.":[110],"number":[112],"hops":[114],"needed":[115],"to":[116,145],"route":[117],"a":[118,142],"message":[119],"using":[120],"above":[122,159],"les/log":[126,129,132],"N":[133],"les/2":[136],"respectively.":[139],"We":[140],"generalized":[143],"approach":[144],"design":[146],"for":[151],"networks,":[155],"based":[156],"algorithms.":[160]},"counts_by_year":[],"updated_date":"2026-03-21T08:13:44.787528","created_date":"2025-10-10T00:00:00"}