Fault-Tolerant Consensus Algorithms with Homonyms - Tran-The, Hung
46,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 6-10 Tagen
  • Broschiertes Buch

So far, the distributed computing community has either assumed that all the processes of a distributed system have distinct identifiers or, more rarely, that the processes are anonymous and have no identifiers. These are two extremes of the same general model: namely,n processes use l different identifiers, where 1 l n. We call this model homonymous model. To determine the power of homonymous model as well as the importance of identifiers in distributed computing, this thesis studies algorithms for solving the consensus problem, one of the most famous distributed computing problem.

Andere Kunden interessierten sich auch für
Produktbeschreibung
So far, the distributed computing community has either assumed that all the processes of a distributed system have distinct identifiers or, more rarely, that the processes are anonymous and have no identifiers. These are two extremes of the same general model: namely,n processes use l different identifiers, where 1 l n. We call this model homonymous model. To determine the power of homonymous model as well as the importance of identifiers in distributed computing, this thesis studies algorithms for solving the consensus problem, one of the most famous distributed computing problem.
Autorenporträt
I have worked as a post doctoral researcher at INESC-ID, Lisbon, Portugal and received my PhD from university Paris 7, France. My main research interests are in fault-tolerant algorithms in distributed networks, dynamic networks.