{"id":"https://openalex.org/W2125285973","doi":"https://doi.org/10.1109/mascot.2002.1167076","title":"Disha: a performance model of a true fully adaptive routing algorithm in k-ary n-cubes","display_name":"Disha: a performance model of a true fully adaptive routing algorithm in k-ary n-cubes","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2125285973","doi":"https://doi.org/10.1109/mascot.2002.1167076","mag":"2125285973"},"language":"en","primary_location":{"id":"doi:10.1109/mascot.2002.1167076","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mascot.2002.1167076","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","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/A5091782280","display_name":"Ahmad Khonsari","orcid":"https://orcid.org/0000-0002-8669-4001"},"institutions":[{"id":"https://openalex.org/I7882870","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53","country_code":"GB","type":"education","lineage":["https://openalex.org/I7882870"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"A. Khonsari","raw_affiliation_strings":["Department of Computing Science, University of Glasgow, Glasgow, UK","Dept. of Comput. Sci, Glasgow Univ., UK"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Glasgow, Glasgow, UK","institution_ids":["https://openalex.org/I7882870"]},{"raw_affiliation_string":"Dept. of Comput. Sci, Glasgow Univ., UK","institution_ids":["https://openalex.org/I7882870"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033908607","display_name":"A. Farahani","orcid":null},"institutions":[{"id":"https://openalex.org/I7882870","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53","country_code":"GB","type":"education","lineage":["https://openalex.org/I7882870"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A. Farahani","raw_affiliation_strings":["Department of Computing Science, University of Glasgow, Glasgow, UK","Dept. of Comput. Sci, Glasgow Univ., UK"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Glasgow, Glasgow, UK","institution_ids":["https://openalex.org/I7882870"]},{"raw_affiliation_string":"Dept. of Comput. Sci, Glasgow Univ., UK","institution_ids":["https://openalex.org/I7882870"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112010073","display_name":"M. Ould\u2010Khaoua","orcid":null},"institutions":[{"id":"https://openalex.org/I7882870","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53","country_code":"GB","type":"education","lineage":["https://openalex.org/I7882870"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"M. Ould-Khaoua","raw_affiliation_strings":["Department of Computing Science, University of Glasgow, Glasgow, UK","Dept. of Comput. Sci, Glasgow Univ., UK"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Glasgow, Glasgow, UK","institution_ids":["https://openalex.org/I7882870"]},{"raw_affiliation_string":"Dept. of Comput. Sci, Glasgow Univ., UK","institution_ids":["https://openalex.org/I7882870"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5091782280"],"corresponding_institution_ids":["https://openalex.org/I7882870"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.20698763,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"183","last_page":"190"},"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.996999979019165,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9957000017166138,"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/computer-science","display_name":"Computer science","score":0.7510425448417664},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.6670172214508057},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.6501239538192749},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.6027148962020874},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5352621078491211},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5140200853347778},{"id":"https://openalex.org/keywords/adaptive-routing","display_name":"Adaptive routing","score":0.4985935688018799},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4853469431400299},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4740947186946869},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.4109340310096741},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.29289960861206055},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2853161692619324},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.2764434516429901},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2141476571559906}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7510425448417664},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.6670172214508057},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.6501239538192749},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.6027148962020874},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5352621078491211},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5140200853347778},{"id":"https://openalex.org/C24856439","wikidata":"https://www.wikidata.org/wiki/Q352483","display_name":"Adaptive routing","level":5,"score":0.4985935688018799},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4853469431400299},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4740947186946869},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.4109340310096741},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.29289960861206055},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2853161692619324},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2764434516429901},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2141476571559906},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mascot.2002.1167076","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mascot.2002.1167076","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","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":29,"referenced_works":["https://openalex.org/W1502210583","https://openalex.org/W1975305101","https://openalex.org/W1982151351","https://openalex.org/W1994644723","https://openalex.org/W2005062022","https://openalex.org/W2008041840","https://openalex.org/W2057759849","https://openalex.org/W2068646921","https://openalex.org/W2069682484","https://openalex.org/W2074405098","https://openalex.org/W2076357242","https://openalex.org/W2082061264","https://openalex.org/W2092709579","https://openalex.org/W2104674486","https://openalex.org/W2106488896","https://openalex.org/W2121496525","https://openalex.org/W2124417259","https://openalex.org/W2127272160","https://openalex.org/W2127456291","https://openalex.org/W2128513214","https://openalex.org/W2143366304","https://openalex.org/W2147225922","https://openalex.org/W2151831014","https://openalex.org/W2165021839","https://openalex.org/W2331476099","https://openalex.org/W2462193902","https://openalex.org/W3148326493","https://openalex.org/W3169463464","https://openalex.org/W6792986803"],"related_works":["https://openalex.org/W2050076411","https://openalex.org/W2001478969","https://openalex.org/W1542183432","https://openalex.org/W2360686363","https://openalex.org/W1900787600","https://openalex.org/W2136552483","https://openalex.org/W2117224408","https://openalex.org/W2166954426","https://openalex.org/W3137070212","https://openalex.org/W2379911191"],"abstract_inverted_index":{"A":[0],"number":[1],"of":[2,20,89,120,137],"analytical":[3,118],"models":[4],"for":[5,27,139],"predicting":[6],"message":[7],"latency":[8],"in":[9,16,54,57,122],"k-ary":[10,124],"n-cubes":[11],"have":[12,24,38],"recently":[13],"been":[14,25],"reported":[15],"the":[17,130],"literature.":[18],"Most":[19],"these":[21],"models,":[22],"however,":[23],"discussed":[26],"adaptive":[28,93],"routing":[29,42,94],"algorithms":[30,43],"based":[31,44],"on":[32,45,72],"deadlock":[33,46],"avoidance.":[34],"Several":[35],"research":[36],"studies":[37],"empirically":[39],"demonstrated":[40],"that":[41,51,96,129],"recovery":[47],"offer":[48],"maximal":[49],"adaptivity":[50],"can":[52],"result":[53],"considerable":[55],"improvement":[56],"network":[58],"performance.":[59],"Disha":[60,121],"(see":[61],"Anjan,":[62],"K.V.":[63],"and":[64,104,143],"Pinkston,":[65,77],"T.M.,":[66,78],"Proc.":[67],"22nd":[68],"ACM/IEEE":[69],"Int.":[70],"Symp.":[71],"Computer":[73],"Architecture,":[74],"p.201-10,":[75],"1996;":[76],"IEEE":[79],"Trans.":[80],"Computers,":[81],"vol.7,":[82],"no.48,":[83],"p.649-69,":[84],"1999)":[85],"is":[86],"an":[87],"example":[88],"a":[90,102,116,134],"true":[91],"fully":[92],"algorithm":[95],"uses":[97],"minimal":[98],"hardware":[99],"to":[100,108],"implement":[101],"simple":[103],"efficient":[105],"progressive":[106],"method":[107],"recover":[109],"from":[110],"potential":[111],"deadlocks.":[112],"The":[113],"paper":[114],"proposes":[115],"new":[117],"model":[119,132],"wormhole-routed":[123],"n-cubes.":[125],"Simulation":[126],"experiments":[127],"confirm":[128],"proposed":[131],"exhibits":[133],"good":[135],"degree":[136],"accuracy":[138],"various":[140],"networks":[141],"sizes":[142],"under":[144],"different":[145],"traffic":[146],"conditions.":[147]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}