|Periodic Data Retrieval in asynchronous rings with a malicious host|
du groupe Algorithmique Distribuée
|Date|| 2015-01-26 14:00-15:00|
|Titre||Periodic Data Retrieval in asynchronous rings with a malicious host |
|Résumé||The notion of "black hole" has been used extensively in the mobile agent literature to model a crashed node which kills incoming agents without leaving any trace of them. I will consider more powerful models of faulty (or malicious) hosts in the context of the Periodic Data Retrieval problem in asynchronous ring networks. The problem is to collect infinite streams of data generated at the nodes of the network and report them infinitely often to a prescribed safe node (the homebase). I will discuss lower and upper bounds on the optimal number of agents required to perform the task in the presence of a unique malicious host.
(joint work with Nikos Leonardos, Euripides Markou, Aris Pagourtzis, and Matoula Petrolia) |
|Orateur||Evangelos Bampas |
Aucun document lié à cet événement.RetourRetour à l'index