{"id":"https://openalex.org/W4399283274","doi":"https://doi.org/10.1109/pais62114.2024.10541255","title":"The KD-GATS algorithm: A way for Optimizing Data Replication with Kruskal-Dijkstra and Genetic Tabu Strategy","display_name":"The KD-GATS algorithm: A way for Optimizing Data Replication with Kruskal-Dijkstra and Genetic Tabu Strategy","publication_year":2024,"publication_date":"2024-04-24","ids":{"openalex":"https://openalex.org/W4399283274","doi":"https://doi.org/10.1109/pais62114.2024.10541255"},"language":"en","primary_location":{"id":"doi:10.1109/pais62114.2024.10541255","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/pais62114.2024.10541255","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 6th International Conference on Pattern Analysis and Intelligent Systems (PAIS)","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/A5098993570","display_name":"Hazem Bensalah","orcid":null},"institutions":[{"id":"https://openalex.org/I4210154551","display_name":"Centre Hospitalo-Universitaire Bab El Oued","ror":"https://ror.org/05qf3bt68","country_code":"DZ","type":"healthcare","lineage":["https://openalex.org/I4210154551"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Hazem Bensalah","raw_affiliation_strings":["University of El Oued,LIAP Laboratory,El Oued,Algeria,39000"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of El Oued,LIAP Laboratory,El Oued,Algeria,39000","institution_ids":["https://openalex.org/I4210154551"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053722204","display_name":"Abdelkamel Ben Ali","orcid":"https://orcid.org/0000-0002-7967-2023"},"institutions":[{"id":"https://openalex.org/I4210154551","display_name":"Centre Hospitalo-Universitaire Bab El Oued","ror":"https://ror.org/05qf3bt68","country_code":"DZ","type":"healthcare","lineage":["https://openalex.org/I4210154551"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Abdelkamel Ben Ali","raw_affiliation_strings":["University of El Oued,LIAP Laboratory,El Oued,Algeria,39000"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of El Oued,LIAP Laboratory,El Oued,Algeria,39000","institution_ids":["https://openalex.org/I4210154551"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075878316","display_name":"Abdennacer Khelaifa","orcid":null},"institutions":[{"id":"https://openalex.org/I4210154551","display_name":"Centre Hospitalo-Universitaire Bab El Oued","ror":"https://ror.org/05qf3bt68","country_code":"DZ","type":"healthcare","lineage":["https://openalex.org/I4210154551"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Abdennacer Khelaifa","raw_affiliation_strings":["University of El Oued,LIAP Laboratory,El Oued,Algeria,39000"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of El Oued,LIAP Laboratory,El Oued,Algeria,39000","institution_ids":["https://openalex.org/I4210154551"]}]}],"institutions":[],"countries_distinct_count":1,"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":0,"citation_normalized_percentile":{"value":0.099143,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"103","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9980999827384949,"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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.9962999820709229,"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.7708324193954468},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7427709698677063},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.7227567434310913},{"id":"https://openalex.org/keywords/replication","display_name":"Replication (statistics)","score":0.5917379856109619},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5454637408256531},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5447580814361572},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5198341012001038},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4742502272129059},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43730130791664124},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3622193932533264},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32422202825546265},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.2637236714363098},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.15592971444129944},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1394495666027069},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11159536242485046}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7708324193954468},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7427709698677063},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.7227567434310913},{"id":"https://openalex.org/C12590798","wikidata":"https://www.wikidata.org/wiki/Q3933199","display_name":"Replication (statistics)","level":2,"score":0.5917379856109619},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5454637408256531},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5447580814361572},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5198341012001038},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4742502272129059},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43730130791664124},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3622193932533264},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32422202825546265},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2637236714363098},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15592971444129944},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1394495666027069},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11159536242485046},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/pais62114.2024.10541255","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/pais62114.2024.10541255","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 6th International Conference on Pattern Analysis and Intelligent Systems (PAIS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1965680834","https://openalex.org/W2001086920","https://openalex.org/W2015823543","https://openalex.org/W2022168880","https://openalex.org/W2088225541","https://openalex.org/W2126105956","https://openalex.org/W2464277529","https://openalex.org/W2900679012","https://openalex.org/W2928434019","https://openalex.org/W2943927023","https://openalex.org/W2992981415","https://openalex.org/W3013534573","https://openalex.org/W3048252901","https://openalex.org/W3082617338","https://openalex.org/W3083496788","https://openalex.org/W3135716340","https://openalex.org/W3159395410","https://openalex.org/W4221127224","https://openalex.org/W4254055497","https://openalex.org/W4309220930","https://openalex.org/W4387871034","https://openalex.org/W6635097213"],"related_works":["https://openalex.org/W2224940485","https://openalex.org/W2168643831","https://openalex.org/W2075514833","https://openalex.org/W2381791171","https://openalex.org/W4247343174","https://openalex.org/W1987877777","https://openalex.org/W2366189044","https://openalex.org/W2365741636","https://openalex.org/W2011733276","https://openalex.org/W4231225946"],"abstract_inverted_index":{"Data":[0],"replication":[1,34,111],"in":[2,112,135],"distributed":[3,113],"storage":[4,114,129],"networks":[5],"is":[6],"a":[7,41,64,98,103,162],"crucial":[8],"concern":[9],"due":[10,48],"to":[11,30,49,101,137],"its":[12],"suitability":[13],"for":[14,27,107,124,172],"enhancing":[15],"data":[16,33,110],"access":[17],"time,":[18,81],"reliability,":[19],"and":[20,68,84,131,144],"system":[21],"performance.":[22],"Despite":[23],"the":[24,50,70,91,120,126,138,145,155],"critical":[25],"need":[26],"meta-heuristic":[28],"algorithms":[29],"efficiently":[31,59,108],"address":[32],"as":[35,97],"an":[36],"NP-hard":[37],"multi-objective":[38],"optimization":[39],"problem,":[40],"general":[42],"algorithm":[43],"has":[44],"not":[45],"been":[46],"developed":[47],"reasons":[51],"that:":[52],"(i)":[53],"no":[54],"single":[55],"solution":[56,106],"technique":[57],"can":[58],"solve":[60],"all":[61],"instances":[62],"within":[63],"polynomial":[65],"time":[66],"frame;":[67],"(ii)":[69],"problem":[71],"requires":[72],"trade-offs":[73],"among":[74],"multiple":[75],"conflicting":[76],"objectives,":[77],"i.e.,":[78],"storage,":[79],"response":[80],"cost":[82],"efficiency,":[83],"network":[85,166],"infrastructure":[86],"constraints.":[87],"This":[88],"paper":[89,117,152],"presents":[90,154],"Kruskal-Dijkstra":[92],"Genetic":[93,141],"Tabu":[94],"Strategy":[95],"(KD-GATS)":[96],"novel":[99],"approach":[100],"developing":[102],"more":[104],"efficient":[105],"solving":[109],"networks.":[115],"The":[116,151],"will":[118],"demonstrate":[119],"applicability":[121],"of":[122,157,164],"KD-GATS":[123],"minimizing":[125],"cost,":[127],"maximizing":[128],"ratio":[130],"number":[132],"replica":[133],"created":[134],"comparison":[136],"Non-dominated":[139],"Sorting":[140],"Algorithm":[142,149],"(NSGA-II)":[143],"Strength":[146],"Pareto":[147],"Evolutionary":[148],"(SPEA2).":[150],"further":[153],"details":[156],"our":[158],"actual":[159],"tests":[160],"with":[161],"set":[163],"complex":[165],"limitations":[167],"that":[168],"produced":[169],"encouraging":[170],"results":[171],"cloud":[173],"storage.":[174]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}