Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik...
-
Upload
sylvia-gordon -
Category
Documents
-
view
217 -
download
0
Transcript of Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik...
![Page 1: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/1.jpg)
Towards Scalable and Robust Overlay Networks
Christian Scheideler
Institut für Informatik
Technische Universität München
Baruch Awerbuch
Dept. of Computer Science
Johns Hopkins University
![Page 2: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/2.jpg)
Motivation
• Peer-to-peer systems have attracted a lot of attention in recent years
• Many structured peer-to-peer systems use overlay networks based on virtual space
![Page 3: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/3.jpg)
Example
Chord:
• Each peer assigned to (pseudo-)random point in [0,1)
• Each peer at point x connects to peers closest to x+1/2, x+1/4, x+1/8,…(mod 1)
0 1
![Page 4: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/4.jpg)
Basic Goals
Scalability:
• Network has (poly-)logarithmic diameter
• Peers have (poly-)logarithmic degree
• Join/leave require (poly-)logarithmic work
Robustness:
• Network robust against insider and outsider attacks (minimal goal: honest peers form single connected component)
![Page 5: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/5.jpg)
Join-Leave Attacks
In open peer-to-peer systems
Goal: make abuse of join and leave operations hard
• peers may frequently join and leave• not all peers are honest/reliable
![Page 6: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/6.jpg)
Join-Leave Model
• n honest peers• n adversarial peers, <1
Operations:• Join(v): peer v joins the system• Leave(v): peer v leaves the system
Goal: maintain scalability and robustness for any sequence of polynomially many rejoin (leave+join) requests
![Page 7: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/7.jpg)
Join-Leave Model
Goal: maintain scalability and robustness for any sequence of polynomially many rejoin (leave+join) requests
Adversary can decide adaptively which peer (honest or adversarial) has to rejoin
Rejoin(v1) Rejoin(v2) Rejoin(v3) Rejoin(v4)time
![Page 8: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/8.jpg)
More specific goal
• n honest peers, n adversarial peers
• every peer has point in [0,1) (Chord)
For any interval I ½ [0,1) of size (c log n)/n:
• Balancing condition: (log n) peers in I
• Majority condition: honest peers in majority
0 1I
c log n / n
![Page 9: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/9.jpg)
How to satisfy conditions?
(1) use pseudo-random (cryptographic) hash function to map peers to points in [0,1)
• randomly distributes honest peers• does not randomly distribute adversarial peers
![Page 10: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/10.jpg)
How to satisfy conditions?
(2) map peers to random points in [0,1)
![Page 11: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/11.jpg)
How to satisfy conditions?
(3) Group spreading [AS04]:
• Map peers to random points in [0,1)
• Limit lifetime of peers
Too expensive!
![Page 12: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/12.jpg)
Only adversarial peers rejoin
• Rule that works: k-cuckoo rule [AS06]
evict k/n-region
n honest n adversarial
< 1-1/k
Rejoin: leave and join via k-cuckoo rule
![Page 13: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/13.jpg)
Limitation of k-cuckoo rule
• Only works for any sequence of rejoin requests of adversarial peers.
• Does not work for any sequence of rejoin requests.
![Page 14: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/14.jpg)
Local Load Balancing
• Works quite effectively to maintain overlay network if all peers are honest [KSW05]
![Page 15: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/15.jpg)
Random Filling/Flipping
• Fill position of leaving peer with random peer• Flip k/n-region of leaving peer with random k/n-region
![Page 16: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/16.jpg)
Random-Neighbor-Flipping
• Flip random among c log n neighboring k/n-regions with random k/n-region
flip
Analysisdifficult!
![Page 17: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/17.jpg)
k-cuckoo&flip rule
• Join: as before (k-cuckoo rule)
• Leave: random k/n-region among c log n neighboring
k/n-regions, empty & flip it with random k/n-region
n honest n adversarial
flip
Rejoin viak-cuckoo rule
![Page 18: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/18.jpg)
Main Result
Theorem: For any constants and k with <1/4-(2 log k+1)/k, the cuckoo&flip rule satisfies the balancing and majority conditions for a poly number of rejoin requests, w.h.p.
Proof:via several worst-case high-concentration results for honest and adversarial peers
![Page 19: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/19.jpg)
Conclusions
Algorithmic solutions are possible to counter join-leave attacks with constant factor overhead
Concurrent join-leave operations: fine with rate limit enforced by peers
Massive departure of adversarial peers: not a problem due to balancing condition
![Page 20: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/20.jpg)
Conclusions
Problem: strategy is high-level and only covers legal attacks on overlay network (resp. DoS attacks on one honest node at a time)
Low-level protocols:• Most critical issue is random number gen.• Low-level protocol for that in [AS06b]
(works – unlike VSS - for public channels)
![Page 21: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/21.jpg)
Conclusions
Problem: strategy is high-level and only covers legal attacks on overlay network (resp. DoS attacks on one honest node at a time)
Illegal attacks:• Biggest problem low-level DoS attacks• Only oblivious or relatively weak adaptive
attackers can be handled so far
![Page 22: Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.](https://reader035.fdocuments.net/reader035/viewer/2022062423/56649e5f5503460f94b58ac6/html5/thumbnails/22.jpg)
Questions?