{"id":"https://openalex.org/W2013997099","doi":"https://doi.org/10.1142/s0219265900000081","title":"OPTIMUM CONGESTED ROUTING STRATEGY ON TWISTED CUBES","display_name":"OPTIMUM CONGESTED ROUTING STRATEGY ON TWISTED CUBES","publication_year":2000,"publication_date":"2000-06-01","ids":{"openalex":"https://openalex.org/W2013997099","doi":"https://doi.org/10.1142/s0219265900000081","mag":"2013997099"},"language":"en","primary_location":{"id":"doi:10.1142/s0219265900000081","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265900000081","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","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/A5076695450","display_name":"Tseng-Kuei Li","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"TSENG-KUEI LI","raw_affiliation_strings":["Department of Computer and Information Science,  National Chiao Tung University, Hsinchu, Taiwan 300, R.O.C","Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan 300, R.O.C"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science,  National Chiao Tung University, Hsinchu, Taiwan 300, R.O.C","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan 300, R.O.C","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109987374","display_name":"Jimmy J.M. Tan","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"JIMMY J. M. TAN","raw_affiliation_strings":["Department of Computer and Information Science,  National Chiao Tung University, Hsinchu, Taiwan 300, R.O.C","Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan 300, R.O.C"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science,  National Chiao Tung University, Hsinchu, Taiwan 300, R.O.C","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan 300, R.O.C","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104039280","display_name":"Lih\u2010Hsing Hsu","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"LIH-HSING HSU","raw_affiliation_strings":["Department of Computer and Information Science,  National Chiao Tung University, Hsinchu, Taiwan 300, R.O.C","Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan 300, R.O.C"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science,  National Chiao Tung University, Hsinchu, Taiwan 300, R.O.C","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan 300, R.O.C","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017920981","display_name":"Ting\u2010Yi Sung","orcid":"https://orcid.org/0000-0002-6028-0409"},"institutions":[{"id":"https://openalex.org/I4210098366","display_name":"Institute of Information Science, Academia Sinica","ror":"https://ror.org/00z83z196","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210098366","https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"TING-YI SUNG","raw_affiliation_strings":["Institute of Information Science,  Academia Sinica, Taipei, Taiwan 115, R.O.C","Institute of Information Science , Academia Sinica , Taipei, Taiwan 115, R.O.C"],"affiliations":[{"raw_affiliation_string":"Institute of Information Science,  Academia Sinica, Taipei, Taiwan 115, R.O.C","institution_ids":["https://openalex.org/I4210098366"]},{"raw_affiliation_string":"Institute of Information Science , Academia Sinica , Taipei, Taiwan 115, R.O.C","institution_ids":["https://openalex.org/I4210098366"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5076695450"],"corresponding_institution_ids":["https://openalex.org/I148366613"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.17564473,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"01","issue":"02","first_page":"115","last_page":"134"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9939000010490417,"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"}},{"id":"https://openalex.org/T10083","display_name":"Graphene research and applications","score":0.9904000163078308,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6462177634239197},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.6377460360527039},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6247394680976868},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.622722864151001},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5536540150642395},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5397295951843262},{"id":"https://openalex.org/keywords/cube","display_name":"Cube (algebra)","score":0.5178987979888916},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.49327677488327026},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4780479073524475},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.46956610679626465},{"id":"https://openalex.org/keywords/bisection","display_name":"Bisection","score":0.43698054552078247},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.43100547790527344},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.4122500717639923},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.4108336269855499},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38234367966651917},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3463532328605652},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25911208987236023},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.23436540365219116},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2147565484046936},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.19306862354278564},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18081185221672058},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.17054831981658936},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12219506502151489},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.05990147590637207},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.048754751682281494}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6462177634239197},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.6377460360527039},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6247394680976868},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.622722864151001},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5536540150642395},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5397295951843262},{"id":"https://openalex.org/C53051483","wikidata":"https://www.wikidata.org/wiki/Q861555","display_name":"Cube (algebra)","level":2,"score":0.5178987979888916},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.49327677488327026},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4780479073524475},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.46956610679626465},{"id":"https://openalex.org/C31599958","wikidata":"https://www.wikidata.org/wiki/Q3128632","display_name":"Bisection","level":2,"score":0.43698054552078247},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.43100547790527344},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.4122500717639923},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.4108336269855499},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38234367966651917},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3463532328605652},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25911208987236023},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.23436540365219116},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2147565484046936},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.19306862354278564},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18081185221672058},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.17054831981658936},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12219506502151489},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.05990147590637207},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.048754751682281494},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0219265900000081","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265900000081","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1984188070","https://openalex.org/W2014915782","https://openalex.org/W2114119464","https://openalex.org/W2122056736","https://openalex.org/W2130401388","https://openalex.org/W2139328215","https://openalex.org/W2155950798","https://openalex.org/W2161950066"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W2117516174","https://openalex.org/W2041853321","https://openalex.org/W2406963874","https://openalex.org/W2604779282","https://openalex.org/W152510122","https://openalex.org/W2108180468","https://openalex.org/W2068473861","https://openalex.org/W2751383119"],"abstract_inverted_index":{"Given":[0],"a":[1,34,68],"shortest":[2,47,70],"path":[3,48,71],"routing":[4,49,61,72],"algorithm":[5,50,62,73,78],"of":[6,15,23,36,97,101],"an":[7],"interconnection":[8],"network,":[9],"the":[10,16,21,31,37,45,60,94,98],"edge":[11,57,86],"congestion":[12,58,87],"is":[13,63],"one":[14],"important":[17],"factors":[18],"to":[19],"evaluate":[20],"performance":[22],"this":[24,27],"algorithm.":[25],"In":[26],"paper,":[28],"we":[29,66,92],"consider":[30],"twisted":[32,99],"cube,":[33],"variation":[35],"hypercube":[38],"with":[39],"some":[40],"better":[41],"properties,":[42],"and":[43,74,84],"review":[44],"existing":[46],"8":[51],".":[52,90],"We":[53],"find":[54],"that":[55,76],"its":[56],"under":[59],"high.":[64],"Then,":[65],"propose":[67],"new":[69],"show":[75],"our":[77],"has":[79],"optimum":[80,85],"time":[81],"complexity":[82],"O(n)":[83],"2":[88],"n":[89],"Moreover,":[91],"calculate":[93],"bisection":[95],"width":[96],"cube":[100],"dimension":[102],"n.":[103]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}