Chapter 1: Introduction
Chapter Goal: to introduce distributed computing concepts, models and relevant concepts
No of pages - 30
1. Introduction 1.1. What is distributed computing 1.1.1.Characteristics (collection, coherent, same task, consists of nodes etc) 1.2. Distributed algorithms 1.3. Elements of distributed computing 1.4. computational (system) model 1.5. Space / time diagram 1.6. Time, clocks and order 1.7. Broadcast ordering 1.8. types 1.8.1.1.Message passing 1.8.1.2.Shared memory 1.9. Synchrony / timing 1.10. Adversary model 1.11. Faults 1.11.1.Process / program faults 1.11.2.Processor / machine 1.11.3.Communication / link faults 1.11.4.Storage faults 1.11.5.Types (omission, byzantine . . . etc.) 1.11.6.Correct processes 1.11.7.Fault tolerance 1.12. Abstractions 1.12.1.What and why abstractions? 1.12.2.to understand / build distributed computing - helps to state and reason about distributed computing 1.12.3.System model 1.12.4.Processes and links 1.12.5.Communication and networks 1.12.5.1.Latency and bandwidth 1.12.6.Agreement 1.12.7.Cryptography abstractions 1.13. Role of cryptography in distributed systems and consensus 1.14. CAP theorem 1.15. Summary Chapter 2: CryptographyChapter Goal: to understand cryptography and build ground for use of cryptography in consensus
No of pages - 30
2. Cryptography 2.1.1.What is cryptography 2.1.2.CIA triad 2.1.3.Symmetric cryptography 2.1.4.Asymmetric cryptography 2.1.5.Hash functions 2.1.6.MACs 2.1.7.Digital signatures 2.1.8.Privacy 2.1.9.Zero knowledge 2.1.10.Summary Chapter 3: Distributed consensusChapter Goal: to introduced the subject of consensus, why its important, history, how it developed, what are the requirements and relevant results and abstractions.
No of pages - 30
3. Distributed consensus 3.1. What is distributed consensus 3.1.1.Agreement abstraction 3.2. Goal of distributed consensus 3.2.1.Safety 3.2.2.liveness 3.2.3.Other properties and goals 3.3. Consensus system model 3.4. History 3.5. Types 3.6. Building blocks 3.7. Other abstractions 3.8. Two generals problem - network model 3.9. Byzantine generals problem - node behaviour model 3.10. Byzantine agreement 3.11. Replication 3.12. Primary - backup model 3.13. State machine replication 3.14. Fundamental results, lowLe informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
(nessuna copia disponibile)
Cerca: Inserisci un desiderataNon riesci a trovare il libro che stai cercando? Continueremo a cercarlo per te. Se uno dei nostri librai lo aggiunge ad AbeBooks, ti invieremo una notifica!
Inserisci un desiderata