@inBook{
 title = {Exploring Complex Networks with Failure-Prone Agents},
 type = {inBook},
 year = {2017},
 identifiers = {[object Object]},
 pages = {81-98},
 volume = {10062 LNAI},
 websites = {https://doi.org/10.1007/978-3-319-62428-0_7,http://link.springer.com/10.1007/978-3-319-62428-0_7},
 publisher = {Lecture Notes In Computer Science},
 city = {Cham},
 editors = {[object Object],[object Object]},
 id = {5ad24444-c9f0-3cc5-884c-4c66025e88ed},
 created = {2017-08-14T21:27:07.176Z},
 file_attached = {true},
 profile_id = {48596512-087a-3be6-8e68-21c90329c4c9},
 last_modified = {2020-03-09T22:13:45.536Z},
 read = {true},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {Rodriguez2016},
 source_type = {inbook},
 private_publication = {false},
 abstract = {Distributed data-collection and synchronization is essential in sensor networks and the Internet of Things (IoT), as well as for data-replication in server farms, clusters and clouds. Generally, such systems consist of a set of interconnected components, which cooperate and coordinate to achieve a collective task, while acting locally and being failure-prone. An important challenge is hence to define efficient and robust algorithms for data collection and synchronisation in large-scale, distributed and failure-prone platforms. This paper studies the performance and robustness of different multi-agent algorithms in complex networks with different topologies (Lattice, Small-world, Community and Scale-free) and different agent failure rates. Agents proceed from random locations and explore the network to collect local data hosted in each node. Their exploration algorithm determines how fast they cover unexplored nodes to collect new data, and how often they meet other agents to exchange complementary data and speed-up the process. Two exploration algorithms are studied: one random and one using a stigmergy model (that we propose). Experimental results show how network topologies and agent failure-rates impact data-collection and synchronization, and how a stigmergy-based approach can improve performance and success rates across most scenarios. We believe these results offer key insights into the suitability of various decentralised algorithms in different networked environments, which are increasingly at the core of modern information and communication technology (ICT) systems. © Springer International Publishing AG 2017.},
 bibtype = {inBook},
 author = {Rodríguez, Arles and Gómez, Jonatan and Diaconescu, Ada},
 book = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}
}

{"_id":"Z4YB4T2cXzCkFskBK","bibbaseid":"rodrguez-gmez-diaconescu-exploringcomplexnetworkswithfailureproneagents-2017","authorIDs":[],"author_short":["Rodríguez, A.","Gómez, J.","Diaconescu, A."],"bibdata":{"title":"Exploring Complex Networks with Failure-Prone Agents","type":"inBook","year":"2017","identifiers":"[object Object]","pages":"81-98","volume":"10062 LNAI","websites":"https://doi.org/10.1007/978-3-319-62428-0_7,http://link.springer.com/10.1007/978-3-319-62428-0_7","publisher":"Lecture Notes In Computer Science","city":"Cham","editors":"[object Object],[object Object]","id":"5ad24444-c9f0-3cc5-884c-4c66025e88ed","created":"2017-08-14T21:27:07.176Z","file_attached":"true","profile_id":"48596512-087a-3be6-8e68-21c90329c4c9","last_modified":"2020-03-09T22:13:45.536Z","read":"true","starred":false,"authored":"true","confirmed":"true","hidden":false,"citation_key":"Rodriguez2016","source_type":"inbook","private_publication":false,"abstract":"Distributed data-collection and synchronization is essential in sensor networks and the Internet of Things (IoT), as well as for data-replication in server farms, clusters and clouds. Generally, such systems consist of a set of interconnected components, which cooperate and coordinate to achieve a collective task, while acting locally and being failure-prone. An important challenge is hence to define efficient and robust algorithms for data collection and synchronisation in large-scale, distributed and failure-prone platforms. This paper studies the performance and robustness of different multi-agent algorithms in complex networks with different topologies (Lattice, Small-world, Community and Scale-free) and different agent failure rates. Agents proceed from random locations and explore the network to collect local data hosted in each node. Their exploration algorithm determines how fast they cover unexplored nodes to collect new data, and how often they meet other agents to exchange complementary data and speed-up the process. Two exploration algorithms are studied: one random and one using a stigmergy model (that we propose). Experimental results show how network topologies and agent failure-rates impact data-collection and synchronization, and how a stigmergy-based approach can improve performance and success rates across most scenarios. We believe these results offer key insights into the suitability of various decentralised algorithms in different networked environments, which are increasingly at the core of modern information and communication technology (ICT) systems. © Springer International Publishing AG 2017.","bibtype":"inBook","author":"Rodríguez, Arles and Gómez, Jonatan and Diaconescu, Ada","book":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","bibtex":"@inBook{\n title = {Exploring Complex Networks with Failure-Prone Agents},\n type = {inBook},\n year = {2017},\n identifiers = {[object Object]},\n pages = {81-98},\n volume = {10062 LNAI},\n websites = {https://doi.org/10.1007/978-3-319-62428-0_7,http://link.springer.com/10.1007/978-3-319-62428-0_7},\n publisher = {Lecture Notes In Computer Science},\n city = {Cham},\n editors = {[object Object],[object Object]},\n id = {5ad24444-c9f0-3cc5-884c-4c66025e88ed},\n created = {2017-08-14T21:27:07.176Z},\n file_attached = {true},\n profile_id = {48596512-087a-3be6-8e68-21c90329c4c9},\n last_modified = {2020-03-09T22:13:45.536Z},\n read = {true},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {Rodriguez2016},\n source_type = {inbook},\n private_publication = {false},\n abstract = {Distributed data-collection and synchronization is essential in sensor networks and the Internet of Things (IoT), as well as for data-replication in server farms, clusters and clouds. Generally, such systems consist of a set of interconnected components, which cooperate and coordinate to achieve a collective task, while acting locally and being failure-prone. An important challenge is hence to define efficient and robust algorithms for data collection and synchronisation in large-scale, distributed and failure-prone platforms. This paper studies the performance and robustness of different multi-agent algorithms in complex networks with different topologies (Lattice, Small-world, Community and Scale-free) and different agent failure rates. Agents proceed from random locations and explore the network to collect local data hosted in each node. Their exploration algorithm determines how fast they cover unexplored nodes to collect new data, and how often they meet other agents to exchange complementary data and speed-up the process. Two exploration algorithms are studied: one random and one using a stigmergy model (that we propose). Experimental results show how network topologies and agent failure-rates impact data-collection and synchronization, and how a stigmergy-based approach can improve performance and success rates across most scenarios. We believe these results offer key insights into the suitability of various decentralised algorithms in different networked environments, which are increasingly at the core of modern information and communication technology (ICT) systems. © Springer International Publishing AG 2017.},\n bibtype = {inBook},\n author = {Rodríguez, Arles and Gómez, Jonatan and Diaconescu, Ada},\n book = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}\n}","author_short":["Rodríguez, A.","Gómez, J.","Diaconescu, A."],"urls":{"Paper":"https://bibbase.org/service/mendeley/48596512-087a-3be6-8e68-21c90329c4c9/file/25e7e8cf-e0b6-92c7-5e09-74b1a12a3c18/crpaper.pdf.pdf","Website":"https://doi.org/10.1007/978-3-319-62428-0_7,http://link.springer.com/10.1007/978-3-319-62428-0_7"},"bibbaseid":"rodrguez-gmez-diaconescu-exploringcomplexnetworkswithfailureproneagents-2017","role":"author","downloads":0},"bibtype":"inBook","creationDate":"2019-11-06T18:36:18.026Z","downloads":0,"keywords":[],"search_terms":["exploring","complex","networks","failure","prone","agents","rodríguez","gómez","diaconescu"],"title":"Exploring Complex Networks with Failure-Prone Agents","year":2017}