{"id":"https://openalex.org/W2544326305","doi":"https://doi.org/10.1109/issoc.2003.1267730","title":"New adaptive routing algorithm for extended generalized fat trees on-chip","display_name":"New adaptive routing algorithm for extended generalized fat trees on-chip","publication_year":2004,"publication_date":"2004-06-21","ids":{"openalex":"https://openalex.org/W2544326305","doi":"https://doi.org/10.1109/issoc.2003.1267730","mag":"2544326305"},"language":"en","primary_location":{"id":"doi:10.1109/issoc.2003.1267730","is_oa":false,"landing_page_url":"https://doi.org/10.1109/issoc.2003.1267730","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 2003 International Symposium on System-on-Chip (IEEE Cat. No.03EX748)","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/A5089240353","display_name":"Heikki Kariniemi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210133110","display_name":"Tampere University","ror":null,"country_code":"FI","type":null,"lineage":["https://openalex.org/I4210133110"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"H. Kariniemi","raw_affiliation_strings":["Institute of Digital and Computer Systems, Tampere University of Technology, Tampere, Finland"],"affiliations":[{"raw_affiliation_string":"Institute of Digital and Computer Systems, Tampere University of Technology, Tampere, Finland","institution_ids":["https://openalex.org/I4210133110"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035297149","display_name":"Jari Nurmi","orcid":"https://orcid.org/0000-0003-2169-4606"},"institutions":[{"id":"https://openalex.org/I4210133110","display_name":"Tampere University","ror":null,"country_code":"FI","type":null,"lineage":["https://openalex.org/I4210133110"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"J. Nurmi","raw_affiliation_strings":["Institute of Digital and Computer Systems, Tampere University of Technology, Tampere, Finland"],"affiliations":[{"raw_affiliation_string":"Institute of Digital and Computer Systems, Tampere University of Technology, Tampere, Finland","institution_ids":["https://openalex.org/I4210133110"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089240353"],"corresponding_institution_ids":["https://openalex.org/I4210133110"],"apc_list":null,"apc_paid":null,"fwci":2.3176,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.90634043,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"113","last_page":"118"},"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9843999743461609,"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.984000027179718,"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/scalability","display_name":"Scalability","score":0.8108426332473755},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6954487562179565},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6608631014823914},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.6565591096878052},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.5531771779060364},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5197548270225525},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5087712407112122},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4914916753768921},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.47389593720436096},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.4408937990665436},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.43502798676490784},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4334872364997864},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42562294006347656},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4230969548225403},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.35994771122932434},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.26910102367401123},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25241124629974365},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.24424275755882263},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22550222277641296},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07029399275779724},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.05703634023666382}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.8108426332473755},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6954487562179565},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6608631014823914},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.6565591096878052},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.5531771779060364},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5197548270225525},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5087712407112122},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4914916753768921},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.47389593720436096},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.4408937990665436},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.43502798676490784},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4334872364997864},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42562294006347656},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4230969548225403},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.35994771122932434},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.26910102367401123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25241124629974365},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.24424275755882263},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22550222277641296},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07029399275779724},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.05703634023666382},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/issoc.2003.1267730","is_oa":false,"landing_page_url":"https://doi.org/10.1109/issoc.2003.1267730","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 2003 International Symposium on System-on-Chip (IEEE Cat. No.03EX748)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1593266071","https://openalex.org/W2011403724","https://openalex.org/W2012288359","https://openalex.org/W2027929919","https://openalex.org/W2042876290","https://openalex.org/W2068028029","https://openalex.org/W2096061336","https://openalex.org/W2102844623","https://openalex.org/W2123184444","https://openalex.org/W2141381960","https://openalex.org/W2142822378","https://openalex.org/W2156496677","https://openalex.org/W2160642395","https://openalex.org/W2171399967"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W2068473861","https://openalex.org/W757657516","https://openalex.org/W2351878639","https://openalex.org/W2539097916","https://openalex.org/W2136173851","https://openalex.org/W2555559350","https://openalex.org/W2607223747","https://openalex.org/W2361465121"],"abstract_inverted_index":{"Network":[0],"topology":[1],"and":[2,35],"routing":[3,44],"algorithm":[4],"are":[5,76,87],"the":[6,10,15,31,38,59,72,94,98,102],"issues":[7,112],"that":[8],"have":[9],"most":[11,39],"significant":[12],"effect":[13],"on":[14],"performance":[16],"of":[17,22,79,97],"packet-switched":[18],"networks.":[19],"The":[20,74],"throughput":[21,96],"fat":[23,68,80],"trees":[24,69,81],"can":[25,61],"be":[26,63],"considerably":[27],"improved":[28,83,95],"by":[29,36],"connecting":[30],"topmost":[32],"switches":[33],"together":[34],"replacing":[37],"usually":[40],"used":[41,64,105],"minimal":[42],"(shortest-path)":[43],"algorithms":[45],"with":[46,82],"a":[47],"new":[48],"turn":[49],"back":[50],"when":[51,101],"possible":[52],"(TBWP)":[53],"algorithm.":[54],"This":[55,108],"paper":[56,109],"shows":[57],"how":[58],"TBWP":[60,103],"also":[62,88,111],"in":[65,106],"extended":[66],"generalized":[67],"(XGFT)":[70],"after":[71],"modification.":[73],"XGFTs":[75,100],"one":[77],"version":[78],"scalability.":[84,115],"Simulation":[85],"results":[86],"presented":[89],"so":[90],"as":[91],"to":[92,114],"show":[93],"modified":[99],"is":[104],"them.":[107],"concerns":[110],"related":[113]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}