{"id":"https://openalex.org/W2065107411","doi":"https://doi.org/10.1142/s0129626407002971","title":"A PERFORMANCE MODEL OF DISHA ROUTING IN K-ARY N-CUBE NETWORKS","display_name":"A PERFORMANCE MODEL OF DISHA ROUTING IN K-ARY N-CUBE NETWORKS","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W2065107411","doi":"https://doi.org/10.1142/s0129626407002971","mag":"2065107411"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626407002971","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626407002971","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"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":"Parallel Processing Letters","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/A5091782280","display_name":"Ahmad Khonsari","orcid":"https://orcid.org/0000-0002-8669-4001"},"institutions":[{"id":"https://openalex.org/I23946033","display_name":"University of Tehran","ror":"https://ror.org/05vf56z40","country_code":"IR","type":"education","lineage":["https://openalex.org/I23946033"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"A. KHONSARI","raw_affiliation_strings":["Department of ECE, University of Tehran and IPM, School of Computer Science, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of ECE, University of Tehran and IPM, School of Computer Science, Iran","institution_ids":["https://openalex.org/I23946033"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011632163","display_name":"Alireza Shahrabi","orcid":"https://orcid.org/0000-0002-6583-0617"},"institutions":[{"id":"https://openalex.org/I195939026","display_name":"Glasgow Caledonian University","ror":"https://ror.org/03dvm1235","country_code":"GB","type":"education","lineage":["https://openalex.org/I195939026"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A. SHAHRABI","raw_affiliation_strings":["School of Computing & Mathematical Sciences, Glasgow Caledonian University, G4 0BA, U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing & Mathematical Sciences, Glasgow Caledonian University, G4 0BA, U.K","institution_ids":["https://openalex.org/I195939026"]}]},{"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, G12 8QQ, U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Glasgow, Glasgow, G12 8QQ, U.K","institution_ids":["https://openalex.org/I7882870"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.13884355,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"17","issue":"02","first_page":"213","last_page":"228"},"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/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"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9954000115394592,"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/computer-science","display_name":"Computer science","score":0.762164831161499},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.6666572093963623},{"id":"https://openalex.org/keywords/adaptive-routing","display_name":"Adaptive routing","score":0.6519607901573181},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.62794429063797},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.6196784973144531},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5702135562896729},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5412132740020752},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.49130311608314514},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.476815402507782},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.44260215759277344},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.44096362590789795},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4103768765926361},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36612263321876526},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.33736321330070496},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.22892439365386963}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.762164831161499},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.6666572093963623},{"id":"https://openalex.org/C24856439","wikidata":"https://www.wikidata.org/wiki/Q352483","display_name":"Adaptive routing","level":5,"score":0.6519607901573181},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.62794429063797},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.6196784973144531},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5702135562896729},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5412132740020752},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.49130311608314514},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.476815402507782},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.44260215759277344},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44096362590789795},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4103768765926361},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36612263321876526},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.33736321330070496},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.22892439365386963},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129626407002971","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626407002971","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"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":"Parallel Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:researchonline.gcu.ac.uk:openaire_cris_publications/2fb742e6-a531-422f-9119-8dcb98fcf7f7","is_oa":false,"landing_page_url":"https://researchonline.gcu.ac.uk/en/publications/2fb742e6-a531-422f-9119-8dcb98fcf7f7","pdf_url":null,"source":{"id":"https://openalex.org/S4306402566","display_name":"ResearchOnline (Glasgow Caledonian University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I195939026","host_organization_name":"Glasgow Caledonian University","host_organization_lineage":["https://openalex.org/I195939026"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Khonsari, A, Shahrabi, A & Ould-Khaoua, M 2007, 'A performance model of disha routing in k-ary n-cube networks', Parallel Processing Letters, vol. 17, no. 2, pp. 213-228. https://doi.org/10.1142/S0129626407002971","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1499886916","https://openalex.org/W1994644723","https://openalex.org/W2057759849","https://openalex.org/W2085381789","https://openalex.org/W2092709579","https://openalex.org/W2093343353","https://openalex.org/W2102146383","https://openalex.org/W2104674486","https://openalex.org/W2127272160","https://openalex.org/W2128513214","https://openalex.org/W2154323564","https://openalex.org/W3169463464","https://openalex.org/W4242572797"],"related_works":["https://openalex.org/W2050076411","https://openalex.org/W4226119751","https://openalex.org/W1542183432","https://openalex.org/W2360686363","https://openalex.org/W2001478969","https://openalex.org/W1900787600","https://openalex.org/W2136552483","https://openalex.org/W2166954426","https://openalex.org/W4383684213","https://openalex.org/W2045082154"],"abstract_inverted_index":{"A":[0],"number":[1],"of":[2,20,67,98,115],"analytical":[3,96],"models":[4],"for":[5,27,117],"predicting":[6],"message":[7],"latency":[8],"in":[9,16,57,60,100],"k-ary":[10,102],"n-cubes":[11],"have":[12,24,41],"recently":[13],"been":[14,25],"reported":[15],"the":[17,108],"literature.":[18],"Most":[19],"these":[21],"models,":[22],"however,":[23],"discussed":[26],"adaptive":[28,71],"routing":[29,45,72],"algorithms":[30,46],"based":[31,47],"on":[32,48],"deadlock":[33,49],"avoidance,":[34],"e.g.":[35],"Duato's":[36],"routing.":[37],"Several":[38],"research":[39],"studies":[40],"empirically":[42],"demonstrated":[43],"that":[44,54,74,107],"recovery":[50],"offer":[51],"maximal":[52],"adaptivity":[53],"can":[55],"result":[56],"considerable":[58],"improvement":[59],"network":[61],"performance.":[62],"Disha":[63,99],"is":[64],"an":[65],"example":[66],"a":[68,80,94,112],"true":[69],"fully":[70],"algorithm":[73],"uses":[75],"minimal":[76],"hardware":[77],"to":[78,86],"implement":[79],"simple":[81],"and":[82,121],"efficient":[83],"progressive":[84],"method":[85],"recover":[87],"from":[88],"potential":[89],"deadlocks.":[90],"This":[91],"paper":[92],"proposes":[93],"new":[95],"model":[97,110],"wormhole-routed":[101],"n-cubes.":[103],"Simulation":[104],"experiments":[105],"confirm":[106],"proposed":[109],"exhibits":[111],"good":[113],"degree":[114],"accuracy":[116],"various":[118],"networks":[119],"sizes":[120],"under":[122],"different":[123],"traffic":[124],"conditions.":[125]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}