{"id":"https://openalex.org/W2063583978","doi":"https://doi.org/10.1080/00207160410001715302","title":"Finding a fault tolerant routing on neighbour-faulty hypercube","display_name":"Finding a fault tolerant routing on neighbour-faulty hypercube","publication_year":2004,"publication_date":"2004-08-30","ids":{"openalex":"https://openalex.org/W2063583978","doi":"https://doi.org/10.1080/00207160410001715302","mag":"2063583978"},"language":"en","primary_location":{"id":"doi:10.1080/00207160410001715302","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160410001715302","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5013595822","display_name":"P\u0131nar Erbay D\u00fcndar","orcid":"https://orcid.org/0000-0002-9923-9657"},"institutions":[{"id":"https://openalex.org/I4210153001","display_name":"North-West State Technical University","ror":"https://ror.org/04dm8yx03","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210153001"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Pinar D\u00fcndar","raw_affiliation_strings":["Correspondencedundar@sci.ege.edu.tr"],"affiliations":[{"raw_affiliation_string":"Correspondencedundar@sci.ege.edu.tr","institution_ids":["https://openalex.org/I4210153001"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040260755","display_name":"Elgin K\u0131l\u0131\u00e7","orcid":"https://orcid.org/0000-0002-1074-5589"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Elgin Kili\u00e7 \u2020","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013595822"],"corresponding_institution_ids":["https://openalex.org/I4210153001"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.16567463,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"81","issue":"9","first_page":"1043","last_page":"1049"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9991999864578247,"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.9991999864578247,"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.9835000038146973,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9824000000953674,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.6848670244216919},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.651204526424408},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6411347389221191},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5703070163726807},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5404757857322693},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5097371935844421},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.5048587918281555},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5047053098678589},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.46059736609458923},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.45153480768203735},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.43119609355926514},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4158655107021332},{"id":"https://openalex.org/keywords/routing-domain","display_name":"Routing domain","score":0.41412973403930664},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.39627805352211},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35077857971191406},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2932742238044739},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.24107980728149414},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.21188461780548096},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.12380030751228333}],"concepts":[{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.6848670244216919},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.651204526424408},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6411347389221191},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5703070163726807},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5404757857322693},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5097371935844421},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.5048587918281555},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5047053098678589},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.46059736609458923},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45153480768203735},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.43119609355926514},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4158655107021332},{"id":"https://openalex.org/C94600068","wikidata":"https://www.wikidata.org/wiki/Q7371621","display_name":"Routing domain","level":5,"score":0.41412973403930664},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.39627805352211},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35077857971191406},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2932742238044739},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.24107980728149414},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.21188461780548096},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.12380030751228333},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160410001715302","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160410001715302","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6800000071525574,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1969859239","https://openalex.org/W1993955016","https://openalex.org/W2051364362","https://openalex.org/W2070974525","https://openalex.org/W2753107708"],"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/W2751383119","https://openalex.org/W2604779282","https://openalex.org/W152510122","https://openalex.org/W1984835167","https://openalex.org/W3195498289"],"abstract_inverted_index":{"It":[0],"is":[1,101,123],"important":[2],"for":[3,119],"a":[4,98,102,105,111],"communication":[5,31,106],"network":[6,63],"to":[7],"route":[8],"data":[9],"efficiently":[10],"among":[11,26],"nodes.":[12,68],"Efficient":[13],"routing":[14,53,80,114],"can":[15],"be":[16],"achieved":[17],"by":[18,23],"using":[19,116],"node-disjoint":[20,24,59],"paths.":[21],"Routing":[22],"paths":[25,45,60],"nodes":[27],"cannot":[28],"only":[29],"avoid":[30],"bottlenecks,":[32],"and":[33,41,77,95],"thus":[34],"increase":[35],"the":[36,55,62,65,91],"efficiency":[37],"of":[38,48,58,93,104],"message":[39],"transmission,":[40],"also":[42],"provide":[43],"alternative":[44],"in":[46,61,74,97],"case":[47],"node":[49],"failures.":[50],"The":[51],"one-to-one":[52],"constructs":[54],"maximum":[56],"number":[57],"between":[64],"two":[66],"given":[67],"Optimal":[69],"algorithms":[70,81],"have":[71],"proved":[72],"sufficiency":[73],"designing":[75],"efficient":[76],"fault":[78,112],"tolerant":[79,113],"on":[82],"hypercube":[83,121],"networks.":[84],"In":[85],"this":[86],"article,":[87],"firstly,":[88],"we":[89,109],"give":[90,110],"concepts":[92],"neighbourhood":[94],"accessibility":[96],"graph,":[99],"which":[100],"model":[103],"network.":[107],"After,":[108],"algorithm":[115],"cube":[117],"algebra":[118],"faulty":[120],"that":[122],"proceeded":[124],"from":[125],"neighbour":[126],"notion.":[127]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}