{"id":"https://openalex.org/W11023143","doi":"https://doi.org/10.2991/978-94-91216-32-9_2","title":"Complexity Analysis of Data Routing Algorithms in Extended Lucas Cube Networks","display_name":"Complexity Analysis of Data Routing Algorithms in Extended Lucas Cube Networks","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W11023143","doi":"https://doi.org/10.2991/978-94-91216-32-9_2","mag":"11023143"},"language":"en","primary_location":{"id":"doi:10.2991/978-94-91216-32-9_2","doi":"https://doi.org/10.2991/978-94-91216-32-9_2","is_oa":false,"landing_page_url":"https://doi.org/10.2991/978-94-91216-32-9_2","pdf_url":null,"source":{"id":"https://openalex.org/S4210184186","display_name":"Atlantis ambient and pervasive intelligence","issn_l":"1875-7669","issn":["1875-7669","2215-1893"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310315540","host_organization_name":"Atlantis Press","host_organization_lineage":["https://openalex.org/P4310315540"],"host_organization_lineage_names":["Atlantis Press"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Atlantis Ambient and Pervasive Intelligence","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W215406252","display_name":"Web-Based Information Technologies and Distributed Systems"},"type":"book-chapter","is_traditional":true,"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/A5009519812","display_name":"Ernastuti","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210087516","display_name":"Gunadarma University","ror":"https://ror.org/0028q1g19","country_code":"ID","type":"education","lineage":["https://openalex.org/I4210087516"]}],"countries":["ID"],"is_corresponding":false,"raw_author_name":"Ernastuti","raw_affiliation_strings":["gunadarma university"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"gunadarma university","institution_ids":["https://openalex.org/I4210087516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047276336","display_name":"Ravi Ahmad Salim","orcid":"https://orcid.org/0000-0002-4317-7485","observed_orcids":["https://orcid.org/0000-0002-4317-7485"]},"institutions":[{"id":"https://openalex.org/I4210087516","display_name":"Gunadarma University","ror":"https://ror.org/0028q1g19","country_code":"ID","type":"education","lineage":["https://openalex.org/I4210087516"]}],"countries":["ID"],"is_corresponding":false,"raw_author_name":"Ravi A. Salim","raw_affiliation_strings":["gunadarma university"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"gunadarma university","institution_ids":["https://openalex.org/I4210087516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210087516"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00515464,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"25","last_page":"42"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.0,"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/interconnection-networks","display_name":"interconnection networks","score":0.7229999899864197},{"id":"https://openalex.org/keywords/unicast-routing","display_name":"unicast routing","score":0.8610000014305115},{"id":"https://openalex.org/keywords/broadcast-routing","display_name":"broadcast routing","score":0.9779999852180481},{"id":"https://openalex.org/keywords/multicast-routing","display_name":"multicast routing","score":0.9980000257492065},{"id":"https://openalex.org/keywords/deadlock-avoidance","display_name":"deadlock avoidance","score":0.5720000267028809},{"id":"https://openalex.org/keywords/hamiltonian-cycles","display_name":"Hamiltonian cycles","score":0.9639999866485596},{"id":"https://openalex.org/keywords/faulty-hypercubes","display_name":"faulty hypercubes","score":0.6890000104904175},{"id":"https://openalex.org/keywords/fibonacci-cubes","display_name":"Fibonacci cubes","score":0.578000009059906},{"id":"https://openalex.org/keywords/routing-complexity","display_name":"routing complexity","score":0.4320000112056732}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6118167042732239},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.518571674823761},{"id":"https://openalex.org/C53051483","wikidata":"https://www.wikidata.org/wiki/Q861555","display_name":"Cube (algebra)","level":2,"score":0.5113084316253662},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17629557847976685},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13490396738052368}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2991/978-94-91216-32-9_2","doi":"https://doi.org/10.2991/978-94-91216-32-9_2","is_oa":false,"landing_page_url":"https://doi.org/10.2991/978-94-91216-32-9_2","pdf_url":null,"source":{"id":"https://openalex.org/S4210184186","display_name":"Atlantis ambient and pervasive intelligence","issn_l":"1875-7669","issn":["1875-7669","2215-1893"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310315540","host_organization_name":"Atlantis Press","host_organization_lineage":["https://openalex.org/P4310315540"],"host_organization_lineage_names":["Atlantis Press"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Atlantis Ambient and Pervasive Intelligence","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2051364362","https://openalex.org/W2100229519","https://openalex.org/W2101931915","https://openalex.org/W2117833002","https://openalex.org/W2154766192","https://openalex.org/W2166773527","https://openalex.org/W2296027634","https://openalex.org/W4402623133","https://openalex.org/W6605002288"],"related_works":["https://openalex.org/W2153616340","https://openalex.org/W2117833002","https://openalex.org/W1659460895","https://openalex.org/W7065645972","https://openalex.org/W2014837197","https://openalex.org/W7096501906","https://openalex.org/W7033624893","https://openalex.org/W4226237722","https://openalex.org/W2016965039","https://openalex.org/W2741911402"],"abstract_inverted_index":{"We":[0],"introduce":[1],"a":[2,32,43,115,146,189],"class":[3],"of":[4,19,24,34,63,67,99,136],"novel":[5],"interconnection":[6],"topologies":[7],"called":[8],"extended":[9,165,185],"Lucas":[10,166,186],"cube":[11,37],"(ELC).":[12],"The":[13,65,108,125,139,159],"ELC":[14,39,55],"is":[15,29,70,104,154,168],"an":[16,184],"induced":[17],"subgraph":[18],"hypercube":[20,48],"defined":[21],"in":[22,76,87,113,123],"terms":[23],"Fibonacci":[25,36],"strings.":[26],"This":[27],"model":[28],"classified":[30],"as":[31,42],"member":[33],"the":[35,60,72,77,88,134,164],"family.":[38],"can":[40],"serve":[41],"framework":[44],"for":[45,142,150],"studying":[46],"degraded":[47],"due":[49],"to":[50,105,132],"faulty":[51],"nodes":[52],"or":[53],"links.":[54],"maintains":[56],"virtually":[57],"almost":[58],"all":[59],"desirable":[61],"properties":[62],"hypercube.":[64],"focus":[66],"this":[68,80],"paper":[69],"on":[71,183],"data":[73,84],"communication":[74],"aspects":[75],"ELC.":[78,124],"In":[79],"paper,":[81],"we":[82],"study":[83],"routing":[85,102,137],"algorithms":[86,177],"ELC,":[89,143],"namely,":[90],"unicast,":[91],"broadcast":[92,160],"and":[93,119,127,156,171,188],"multicast":[94,176],"algorithms.":[95,138],"An":[96],"important":[97],"property":[98],"any":[100,151],"message":[101],"algorithm":[103,110,141,161],"avoid":[106],"deadlock.":[107],"unicast":[109,140],"always":[111],"succeeds":[112],"finding":[114],"path":[116,149],"between":[117],"them":[118],"ensures":[120],"deadlock":[121],"free":[122],"time":[126,155,173],"traffic":[128,157,169],"steps":[129],"are":[130,178,181],"used":[131],"measure":[133],"efficiency":[135],"which":[144,162],"uses":[145],"Hamming":[147],"distance":[148],"two":[152],"nodes,":[153],"optimal.":[158,174],"employs":[163],"tree":[167,187],"optimal":[170],"near":[172],"Two":[175],"presented;":[179],"they":[180],"based":[182],"Hamiltonian":[190],"cycle,":[191],"respectively.":[192]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}