The Byzantine Agreement problem arises in systems composed of n indipendent cooperating processes, of which at most t can fail, exhibiting unpredictable behaviour. Each process in the system is able to communicate with any other only by message passing; besides, they have independent failure modes and do not know what other processes are faulty.
Efficient algorithms for byzantine agreement
Di Giandomenico F;Grandoni F;
1987
Abstract
The Byzantine Agreement problem arises in systems composed of n indipendent cooperating processes, of which at most t can fail, exhibiting unpredictable behaviour. Each process in the system is able to communicate with any other only by message passing; besides, they have independent failure modes and do not know what other processes are faulty.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_419691-doc_148425.pdf
solo utenti autorizzati
Descrizione: Efficient algorithms for byzantine agreement
Tipologia:
Versione Editoriale (PDF)
Dimensione
4.21 MB
Formato
Adobe PDF
|
4.21 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
