Muutke küpsiste eelistusi

From Traditional Fault Tolerance to Blockchain [Kõva köide]

(University of California, Santa Barbara, CA; Cleveland State University, Cleveland, OH)
  • Formaat: Hardback, 464 pages, kõrgus x laius x paksus: 10x10x10 mm, kaal: 454 g
  • Ilmumisaeg: 17-Aug-2021
  • Kirjastus: Wiley-Scrivener
  • ISBN-10: 1119681952
  • ISBN-13: 9781119681953
Teised raamatud teemal:
From Traditional Fault Tolerance to BlockchainSuurem pilt
  • Formaat: Hardback, 464 pages, kõrgus x laius x paksus: 10x10x10 mm, kaal: 454 g
  • Ilmumisaeg: 17-Aug-2021
  • Kirjastus: Wiley-Scrivener
  • ISBN-10: 1119681952
  • ISBN-13: 9781119681953
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9781119681953.html
Märksõnad:

This book covers the most essential techniques for designing and building dependable distributed systems, from traditional fault tolerance to the blockchain technology. Topics include checkpointing and logging, recovery-orientated computing, replication, distributed consensus, Byzantine fault tolerance, as well as blockchain.

This book intentionally includes traditional fault tolerance techniques so that readers can appreciate better the huge benefits brought by the blockchain technology and why it has been touted as a disruptive technology, some even regard it at the same level of the Internet. This book also expresses a grave concern on using traditional consensus algorithms in blockchain because with the limited scalability of such algorithms, the primary benefits of using blockchain in the first place, such as decentralization and immutability, could be easily lost under cyberattacks.

List of Figures xiii
List of Tables xix
Acknowledgments xxi
Preface xxiii
References xxix
1 Introduction 1(20)
1.1 Basic Concepts and Terminologies for Dependable Computing
2(7)
1.1.1 System Models
2(1)
1.1.2 Threat Models
3(3)
1.1.3 Dependability Attributes and Evaluation Metrics
6(3)
1.2 Means to Achieve Dependability
9(4)
1.2.1 Fault Avoidance
9(1)
1.2.2 Fault Detection and Diagnosis
9(1)
1.2.3 Fault Removal
10(1)
1.2.4 Fault Tolerance
11(2)
1.3 System Security
13(5)
References
18(3)
2 Logging and Checkpointing 21(42)
2.1 System Model
22(5)
2.1.1 Fault Model
23(1)
2.1.2 Process State and Global State
23(3)
2.1.3 Piecewise Deterministic Assumption
26(1)
2.1.4 Output Commit
26(1)
2.1.5 Stable Storage
27(1)
2.2 Checkpoint-Based Protocols
27(13)
2.2.1 Uncoordinated Checkpointing
27(2)
2.2.2 Tamir and Sequin Global Checkpointing Protocol
29(6)
2.2.3 Chandy and Lamport Distributed Snapshot Protocol
35(3)
2.2.4 Discussion
38(2)
2.3 Log Based Protocols
40(20)
2.3.1 Pessimistic Logging
42(9)
2.3.2 Sender-Based Message Logging
51(9)
References
60(3)
3 Recovery-Oriented Computing 63(40)
3.1 System Model
65(3)
3.2 Fault Detection and Localization
68(21)
3.2.1 Component Interactions Modeling and Anomaly Detection
72(4)
3.2.2 Path Shapes Modeling and Root Cause Analysis
76(4)
3.2.3 Inference-Based Fault Diagnosis
80(9)
3.3 Microreboot
89(4)
3.3.1 Microrebootable System Design Guideline
90(1)
3.3.2 Automatic Recovery with Microreboot
91(1)
3.3.3 Implications of the Microrebooting Technique
92(1)
3.4 Overcoming Operator Errors
93(6)
3.4.1 The Operator Undo Model
94(1)
3.4.2 The Operator Undo Framework
95(4)
References
99(4)
4 Data and Service Replication 103(44)
4.1 Service Replication
105(6)
4.1.1 Replication Styles
107(2)
4.1.2 Implementation of Service Replication
109(2)
4.2 Data Replication
111(5)
4.3 Optimistic Replication
116(20)
4.3.1 System Models
117(2)
4.3.2 Establish Ordering among Operations
119(3)
4.3.3 State Transfer Systems
122(4)
4.3.4 Operation Transfer System
126(5)
4.3.5 Update Commitment
131(5)
4.4 CAP Theorem
136(7)
4.4.1 2 out 3
139(1)
4.4.2 Implications of Enabling Partition Tolerance
140(3)
References
143(4)
5 Group Communication Systems 147(52)
5.1 System Model
149(3)
5.2 Sequencer Based Group Communication System
152(14)
5.2.1 Normal Operation
153(4)
5.2.2 Membership Change
157(8)
5.2.3 Proof of Correctness
165(1)
5.3 Sender Based Group Communication System
166(26)
5.3.1 Total Ordering Protocol
167(7)
5.3.2 Membership Change Protocol
174(9)
5.3.3 Recovery Protocol
183(7)
5.3.4 The Flow Control Mechanism
190(2)
5.4 Vector Clock Based Group Communication System
192(5)
References
197(2)
6 Consensus and the Paxos Algorithms 199(46)
6.1 The Consensus Problem
200(2)
6.2 The Paxos Algorithm
202(10)
6.2.1 Algorithm for Choosing a Value
202(2)
6.2.2 Algorithm for Learning a Value
204(1)
6.2.3 Proof of Correctness
204(2)
6.2.4 Reasoning of the Paxos Algorithm
206(6)
6.3 Multi-Paxos
212(4)
6.3.1 Checkpointing and Garbage Collection
213(1)
6.3.2 Leader Election and View Change
214(2)
6.4 Dynamic Paxos
216(11)
6.4.1 Dynamic Paxos
217(3)
6.4.2 Cheap Paxos
220(7)
6.5 Fast Paxos
227(8)
6.5.1 The Basic Steps
228(1)
6.5.2 Collision Recovery, Quorum Requirement, and Value Selection Rule
229(6)
6.6 Implementations of the Paxos Family Algorithms
235(7)
6.6.1 Hard Drive Failures
236(1)
6.6.2 Multiple Coordinators
236(1)
6.6.3 Membership Changes
237(4)
6.6.4 Limited Disk Space for Logging
241(1)
References
242(3)
7 Byzantine Fault Tolerance 245(50)
7.1 The Byzantine Generals Problem
246(15)
7.1.1 System Model
247(3)
7.1.2 The Oral Message Algorithms
250(10)
7.1.3 Proof of Correctness for the Oral Message Algorithms
260(1)
7.2 Practical Byzantine Fault Tolerance
261(16)
7.2.1 System Model
262(1)
7.2.2 Overview of the PBFT Algorithm
263(2)
7.2.3 Normal Operation of PBFT
265(2)
7.2.4 Garbage Collection
267(1)
7.2.5 View Change
268(3)
7.2.6 Proof of Correctness
271(2)
7.2.7 Optimizations
273(4)
7.3 Fast Byzantine Agreement
277(1)
7.4 Speculative Byzantine Fault Tolerance
278(12)
7.4.1 The Agreement Protocol
279(4)
7.4.2 The View Change Protocol
283(5)
7.4.3 The Checkpointing Protocol
288(1)
7.4.4 Proof of Correctness
288(2)
References
290(5)
8 Cryptocurrency and Blockchain 295(54)
8.1 History of Cryptocurrency
295(3)
8.2 Bitcoin
298(19)
8.2.1 Decentralized Network and Architecture
301(1)
8.2.2 Self-Contained Cryptography
302(2)
8.2.3 Decentralized Data Structure
304(9)
8.2.4 Decentralized Algorithms
313(4)
8.3 Ethereum
317(25)
8.3.1 Ethereum Computing Model
318(8)
8.3.2 Block and Consensus
326(14)
8.3.3 Tokenization
340(2)
8.4 Attacks on Blockchain
342(5)
References
347(2)
9 Consensus Algorithms for Blockchain 349(28)
9.1 Model on Blockchain Consensus
353(3)
9.1.1 Requirements on Puzzle Design
354(1)
9.1.2 Zero-Knowledge Proof
355(1)
9.2 Proof of Work
356(1)
9.3 Proof of Resources
357(3)
9.3.1 Using Storage as Resource
357(2)
9.3.2 Using Computing as Resource
359(1)
9.4 Virtual Mining
360(15)
9.4.1 PeerCoin PoS
360(8)
9.4.2 Fixed-Epoch Time Based PoS Schemes
368(3)
9.4.3 Proof of Elapsed Time
371(4)
References
375(2)
10 Blockchain Applications 377(50)
10.1 The Value of Blockchain
378(5)
10.1.1 Non-Functional Benefits
379(3)
10.1.2 Functional Benefits
382(1)
10.2 Blockchain-Enabled Cyber-Physical Systems
383(15)
10.2.1 Cyber-Physical Systems
383(2)
10.2.2 Application Categories
385(5)
10.2.3 Blockchain-Enabled Operations in CPS
390(8)
10.3 On Blockchain Throughput
398(10)
10.3.1 On-Chain Approach
399(3)
10.3.2 Off-Chain Approach
402(6)
10.4 A Critical Look on Blockchain from Economy Perspective
408(11)
10.4.1 Blockchain Technology from the Economic View
409(3)
10.4.2 Economic Functions of Blockchain
412(4)
10.4.3 Blockchain as a Financial Infrastructure
416(3)
References
419(8)
Index 427
Dr. Zhao received the PhD degree in Electrical and Computer Engineering from the University of California, Santa Barbara, in 2002. He is now a Full Professor in the Department of Electrical Engineering and Computer Science at Cleveland State University. He has more than 200 academic publications and three of his recent research papers in the dependable distributed computing area have won the best paper awards. Dr. Zhao also has two US utility patents and a patent application on blockchain under review.