Link
Embed
Share
Beginning
This slide
Copy link URL
Copy link URL
Copy iframe embed code
Copy iframe embed code
Copy javascript embed code
Copy javascript embed code
Share
Tweet
Share
Tweet
Slide 1
Slide 1 text
4 SFC / CSO
[email protected]
— 4 — 2017-02-24 – p.1/34
Slide 2
Slide 2 text
FLP CAP CUP ( ) P2P — 4 — 2017-02-24 – p.2/34
Slide 3
Slide 3 text
1. 2. 3. P2P 4. — 4 — 2017-02-24 – p.3/34
Slide 4
Slide 4 text
1. FLP CAP — 4 — 2017-02-24 – p.4/34
Slide 5
Slide 5 text
A, B A-B m A B A B A B . . . — 4 — 2017-02-24 – p.5/34
Slide 6
Slide 6 text
1. X 2. X C 3. C 1. 2. 3. reliable multicast — 4 — 2017-02-24 – p.6/34
Slide 7
Slide 7 text
: — 4 — 2017-02-24 – p.7/34
Slide 8
Slide 8 text
(safety) (liveness) ( ) ( = ) — 4 — 2017-02-24 – p.8/34
Slide 9
Slide 9 text
→ / (benign) → (Byzantine) (malicious) — 4 — 2017-02-24 – p.9/34
Slide 10
Slide 10 text
FLP Fischer, Lynch, Paterson — 4 — 2017-02-24 – p.10/34
Slide 11
Slide 11 text
CAP Consistency ( ) Availability ( ) Partition tolerance ( ) ⇒ 3 C Eventual consistency ( ) . . . — 4 — 2017-02-24 – p.11/34
Slide 12
Slide 12 text
Consistency ( ) Strong consistency ( ) (safety) Eventual consistency ( ) (liveness) ↑ Weak consistency ( ) ↑ ( ) — 4 — 2017-02-24 – p.12/34
Slide 13
Slide 13 text
n = f ( ) — 4 — 2017-02-24 – p.13/34
Slide 14
Slide 14 text
(1) 1 1, 2 n ≤ 3f — 4 — 2017-02-24 – p.14/34
Slide 15
Slide 15 text
(2) — 4 — 2017-02-24 – p.15/34
Slide 16
Slide 16 text
CS1 : CS2 : CS3 : CL1 : CL2 : : : (e.g. ) — 4 — 2017-02-24 – p.16/34
Slide 17
Slide 17 text
Paxos (1) : (The Part-Time Parliament) Paxos ( ) ↔ ↔ ↔ ⇒ — 4 — 2017-02-24 – p.17/34
Slide 18
Slide 18 text
Paxos (2) (proposers), (acceptors), (learners) 1. 2. Paxos ( ) — 4 — 2017-02-24 – p.18/34
Slide 19
Slide 19 text
Paxos Paxos 2f + 1 Paxos f “byzantizing” Byzantine Paxos PBFT (Practical Byzantine Fault-Tolerance) PBFT — 4 — 2017-02-24 – p.19/34
Slide 20
Slide 20 text
2. CUP (Consensus with Unknown Participants) - — 4 — 2017-02-24 – p.20/34
Slide 21
Slide 21 text
(B)FT-CUP (Consensus with Unknown Participants) ( / ) : FT (Fault-Tolerant) : BFT (Byzantine Fault-Tolerant) P2P n FT/BFT — 4 — 2017-02-24 – p.21/34
Slide 22
Slide 22 text
- n ( ) p.6 — 4 — 2017-02-24 – p.22/34
Slide 23
Slide 23 text
3. P2P P2P - - — 4 — 2017-02-24 – p.23/34
Slide 24
Slide 24 text
P2P : P2P 3 3 ( ) strategyproof group strategyproof — 4 — 2017-02-24 – p.24/34
Slide 25
Slide 25 text
(Sybil) 16 — 4 — 2017-02-24 – p.25/34
Slide 26
Slide 26 text
again n > 3f R F R > 2F ⇒ — 4 — 2017-02-24 – p.26/34
Slide 27
Slide 27 text
( ) f = 1 ⇒ R — 4 — 2017-02-24 – p.27/34
Slide 28
Slide 28 text
4. — 4 — 2017-02-24 – p.28/34
Slide 29
Slide 29 text
3 1. ( ) ⇒ 2. ( ) ⇒ 3. ( ) TX · ⇒ — 4 — 2017-02-24 – p.29/34
Slide 30
Slide 30 text
10 ATM 1 ATM 1 : http://www.slideshare.net/yamaz2/ss-58813038 ⇒ KVS — 4 — 2017-02-24 – p.30/34
Slide 31
Slide 31 text
— 4 — 2017-02-24 – p.31/34
Slide 32
Slide 32 text
vs. — 4 — 2017-02-24 – p.32/34
Slide 33
Slide 33 text
(centralized) (decentralized) (distributed) Paul Baran, “On Distributed Communications Networks”, 1964 (C) (A) — 4 — 2017-02-24 – p.33/34
Slide 34
Slide 34 text
— 4 — 2017-02-24 – p.34/34