- 359 Views
- Updated On :
- Presentation posted in: Sports / GamesEducation / CareerFashion / BeautyGraphics / DesignNews / Politics

Chord Advanced issues Analysis Theorem. Search takes O(log N) time (Note that in general, 2 m may be much larger than N)

Chord Advanced issues

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Chord

Advanced issues

Theorem. Search takes O(log N) time

(Note that in general, 2m may be much larger than N)

Proof. After log N forwarding steps, distance to key is at most . Number of node identifiers in a range of is O(log(N)) with high probability (property of consistent hashing). So by using successors in that range, it will take at most an additional O(log N) forwarding steps.

O(log N) search time is true if finger and successor entries correct, But what if these entries are wrong (which is possible during join or leave operations, or process crash?

N32 crashed. Lookup for K42 fails

(N16 does not know N45)

Say m=7

0

N16

N112

X

N96

X

N32

Who has abcnews.com?

(hashes to K42)

X

N45

N80

File abcnews.com with

key K42 stored here

One solution: maintain r multiple successor entries in case of a failure, use other successor entries.

Reactive vs.

Proactive approach

Say m=7

0

N16

N112

N96

X

N32

Who has abcnews.com?

(hashes to K42)

N45

N80

File abcnews.com with

key K42 stored here

Choosing r=2log(N) suffices to maintain correctness “with high probability”

Say 50% of nodes fail (i.e prob of failure = 1/2)

Pr(for given node, at least one successor alive) =

Lookup fails

(N45 is dead)

Say m=7

0

N16

N112

N96

N32

Who has abcnews.com?

(hashes to K42)

X

X

N45

N80

File abcnews.com with

key K42 stored here

One solution: replicate file/key at r successors and predecessors

Say m=7

0

N16

N112

N96

N32

Who has cnn.com/index.html?

(hashes to K42)

K42 replicated

X

N45

N80

File cnn.com/index.html with

key K42 stored here

K42 replicated

Peers fail

New peers join

Peers leave

Need to update successors and fingers, and ensure keys reside in the right places

Some gateway node directs N40 to N32

N32 updates successor to N40

N40 initializes successor to N45, and obtains fingers from it

N40 periodically talks to neighbors to update finger table

Say m=7

0

Stabilization

protocol

N16

N112

N96

Gateway node

N32

N40

New node

N45

N80

N40 may need to copy some files/keys from N45

(files with fileid between 32 and 40)

Say m=7

0

N16

N112

N96

N32

N40

N45

N80

K34,K38

0

N16

N112

N20

Say m=7

N24

N96

N28

N32

K24

N80

N45

K38

Argue that each node will eventually be reachable

If in a stable network with N nodes, another set of N nodes joins, and the join protocol correctly sets their successors, then lookups will take O(log N) steps w.h.p

Consistent hashing

guarantees that there

be O(log N) new nodes

w.h,p between two

consecutive nodes

0

N16

N112

N20

Transfer pending

N96

N24

Linear Scan

Will locate

K24

N28

K24

N32

N80

N45

K38

N1

Loopy network

N3

N96

N5

N78

N24

N63

- u (successor (predecessor (u))) = u. Still
it is weakly stable but not strongly stable. Why?

N1

(succ (pred (u))) = u

N3

N96

N5

stable

N78

N24

Must be false

for strong stability

N63

What is funny / awkward about this?

v: u < v < successor (u)

(Weakly stable)

- The key idea of recovery from loopiness is: Let each node u
- ask its successor to walk around the ring until it reaches a
- node v : u <v ≤ successor(u). If
- v: u <v < successor(u)
then loopiness exists, and reset successor(u):=v

Takes O(N2) steps. But loopiness is a rare event.

No protocol for recovery exists from a split ring.

- v: u <v < successor(u)

- A new peer affects O(log(N)) other finger entries in the system. So, the number of messages per peer join= O(log(N)*log(N))
- Similar set of operations for dealing with peers leaving

Each node u has fingers to

u+1, u+2, u+4, u+8 … as well as

u-1, u-2, u-4, u-8 …

How does it help?

Cost of lookup

- Cost is O(Log N) as predicted by theory
- constant is 1/2

Average Messages per Lookup

Number of Nodes

Robustness

- Simulation results: static scenario
- Failed lookup means original node with key failed (no replica of keys)

- Result implies good balance of keys among nodes!

Strengths

- Consistent hashing guarantees balance
- Proven performance in many different aspects
- “with high probability” proofs

- Good tolerance to random node failures

Weakness

- Network proximity not addressed
- Protocol security
- Malicious data insertion
- Malicious Chord table information

- Keyword search