[PPT] - Scalable node addressing Scalable node addre and message routing PowerPoint Presentation

SLIDE 1

Scalable node addressing and message routing for global computing

Scalable node addre

lobal computing

SLIDE 2

Peer-to-peer (P2P)

Global computing

SLIDE 3

P2P

message routing

Fault tolerance

SLIDE 4

IP address

IP address Private address

IP addressing Addressing scalable

SLIDE 5

message routing

routing Routing table O(log N) hop routing

(N : )

Minimum-hop neighborly

SLIDE 6

Fault tolerance

Network failure Node failure

SLIDE 7

Phoenix model[’01]

SLIDE 8

Phoenix model on General graphs

(interval)

e.g. [0,16)= {0,1,…,15}

disjoint

[0,264)

1 ()

SLIDE 9

Message routing

64bitkey key routing

SLIDE 10

Routing table

(1)
[0,264)

() key Join

SLIDE 11

(
)

a

64

SLIDE 12

(
)

a

64

b

SLIDE 13

(
)

a

64

b

Join(key=10)

SLIDE 14

(
)

a

64

b

Join(key=10) 10

SLIDE 15

(
)

a

64

b

Join(key=10) 10

SLIDE 16

(
)

a

64

b

Join(key=10) 10

SLIDE 17

(
)

a

64

b

Join(key=10) 10 32

SLIDE 18

(
)

a

64

b

Join(key=10) 10 32

SLIDE 19

(
)

a

64

b

32

SLIDE 20

(
)

a

64

b

32

c

SLIDE 21

(
)

a

64

b

32

c

Join(key=50)

SLIDE 22

(
)

a

64

b

32

c

Join(key=50) 50

SLIDE 23

(
)

a

64

b

32

c

Join(key=50) 50

SLIDE 24

(
)

a

64

b

32

c

Join(key=50) 50

SLIDE 25

(
)

a

64

b

32

c

Join(key=50) 50 48

SLIDE 26

(
)

a

64

b

32

c

Join(key=50) 50 48

SLIDE 27

(
)

a

64

b

32

c

48

SLIDE 28

Routing table

(2)

cluster

Level 0 cluster Level i cluster

Level i - 1 clusterb

SLIDE 29

cluster (

)

b = 2

64 32 16 48 8 24 40 36 a b c d e g h f

SLIDE 30

cluster (

)

b = 2

64 32 16 48 8 24 40 36 a b c d e g h f L=0 a b c d e g h f

SLIDE 31

cluster (

)

b = 2

64 32 16 48 8 24 40 36 a b c d e g h f L=0 a b c d e g h f L=1 a b c d e g h f

SLIDE 32

cluster (

)

b = 2

64 32 16 48 8 24 40 36 a b c d e g h f L=0 a b c d e g h f L=1 a b c d e g h f L=2 a b c d e g h f

SLIDE 33

cluster (

)

b = 2

64 32 16 48 8 24 40 36 a b c d e g h f L=0 a b c d e g h f L=1 a b c d e g h f L=2 a b c d e g h f L=3 a b c d e g h f

SLIDE 34

Routing table

(3)

routing table

level i cluster

blevel i +1 subcluster

b - 1subcluster

Routing table i b - 1
level i +1 subcluster

IP address

SLIDE 35

routing table

(
1)

b = 2

x 4 8 16 32 64

SLIDE 36

routing table

(
1)

b = 2

x 4 8 16 32 64

SLIDE 37

routing table

(
1)

b = 2

x 4 8 16 32 64 a

SLIDE 38

routing table

(
1)

b = 2

x 4 8 16 32 64 a

SLIDE 39

routing table

(
1)

b = 2

x 4 8 16 32 64 a

SLIDE 40

routing table

(
1)

b = 2

x 4 8 16 32 64 a b

SLIDE 41

routing table

(
1)

b = 2

x 4 8 16 32 64 a b

SLIDE 42

routing table

(
1)

b = 2

x 4 8 16 32 64 a b

SLIDE 43

routing table

(
1)

b = 2

x 4 8 16 32 64 a b c

SLIDE 44

routing table

(
1)

b = 2

x 4 8 16 32 64 a b c

SLIDE 45

routing table

(
1)

b = 2

x 4 8 16 32 64 a b c

SLIDE 46

routing table

(
1)

b = 2

x 4 8 16 32 64 a b c d

SLIDE 47

routing table

(
1)

b = 2

x 4 8 16 32 64 a b c d

SLIDE 48

routing table

(
1)

b = 2

x 4 8 16 32 64 a b c d

[0,4) x [4,8) d [8,16) c [16,32) b [32,64) a

x routing table

SLIDE 49

routing table

(
2)

d1 d4 x c3 c2 c1 b1 b3 b4 a2 a3 a4

b = 4, x [30,31)

SLIDE 50

routing table

(
2)

[31,32) d4 [30,31)

x

[29,30) d1 [28,29)d1 [24,48)c3 [20,24)c2 [16,20)c1 [48,64)b4 [32,48) b3 [0,16)b1 [192,256)a4 [128,192)a3 [64,128)a2

b = 4, x [30,31) routing table

SLIDE 51

Routing

Level i routing

level i +1routing

: log N / log b
Routing table : (b - 1) log N / log b
N
b = 16 , N = 220 = 1,048,576
: 5, Routing table: 75

SLIDE 52

(1)
IP address p

1. kkeyJoin(k,p)

2.

k

3.

Routing table NewNode(k,0,p)

SLIDE 53

(2)

NewNode

NewNode (k,i,p) routing

1. Level i + 1subcluster k

l , lkey

NewNeighbor(l,p)routing 2. Level i + 1subcluster k

m

NewNode (m,i+1,p) routing

NewNeighbor (l,p)

1. p IP address

NewNeighbor

routing table

SLIDE 54

(
)

d4

xd4Join (k,p)

SLIDE 55

(
)

d4

xd4Join (k,p)

x

SLIDE 56

(
)

d4

xd4NewNode(k,0,p)

x

SLIDE 57

(
)

d4

xd4NewNode(k,0,p)

x

NewNode

SLIDE 58

(
)

d4 d4kLevel 1subcluser NewNeighbor x

SLIDE 59

(
)

d4 d4kLevel 1subcluser NewNeighbor x a2 a3 a4

SLIDE 60

(
)

d4 d4kLevel 1subcluser NewNeighbor x a2 a3 a4

NewNeigbor NewNeigbor NewNeigbor

SLIDE 61

(
)

d4 NewNeighborIP address x a2 a3 a4

SLIDE 62

(
)

d4 NewNeighborIP address x a2 a3 a4

IP address IP address IP address

SLIDE 63

(
)

d4 d4kLevel 1subcluser NewNode x a2 a3 a4

SLIDE 64

(
)

d4 d4kLevel 1subcluser NewNode x a2 a3 a4 b1

SLIDE 65

(
)

d4 d4kLevel 1subcluser NewNode x a2 a3 a4 b1

NewNode

SLIDE 66

(
)

d4 x a2 a3 a4 b1 b1kLevel 2subcluser NewNeighbor

SLIDE 67

(
)

d4 x a2 a3 a4 b1 b1kLevel 2subcluser NewNeighbor b4 b3

SLIDE 68

(
)

d4 x a2 a3 a4 b1 b1kLevel 2subcluser NewNeighbor b4 b3

NewNeighbor NewNeighbor NewNeighbor

SLIDE 69

(
)

d4 x a2 a3 a4 b1 b4 b3 NewNeighborIP address

SLIDE 70

(
)

d4 x a2 a3 a4 b1 b4 b3 NewNeighborIP address

IP address IP address IP address

SLIDE 71

(
)

d4 x a2 a3 a4 b4 b3 b1kLevel 2subcluser NewNode b1

SLIDE 72

(
)

d4 x a2 a3 a4 b4 b3 b1kLevel 2subcluser NewNode b1 c2

SLIDE 73

(
)

d4 x a2 a3 a4 b4 b3 b1kLevel 2subcluser NewNode b1 c2

NewNode

SLIDE 74

(
)

d4 x a2 a3 a4 b4 b3 b1 c2 c2kLevel 3subcluser NewNeighbor

SLIDE 75

(
)

d4 x a2 a3 a4 b4 b3 b1 c2 c2kLevel 3subcluser NewNeighbor c3 c1

SLIDE 76

(
)

d4 x a2 a3 a4 b4 b3 b1 c2 c2kLevel 3subcluser NewNeighbor c3 c1

NewNeighbor NewNeighbor NewNeighbor

SLIDE 77

(
)

d4 x a2 a3 a4 b4 b3 b1 c2 c3 c1 NewNeighborIP address

SLIDE 78

(
)

d4 x a2 a3 a4 b4 b3 b1 c2 c3 c1 NewNeighborIP address

IP address IP address IP address

SLIDE 79

(
)

d4 x a2 a3 a4 b4 b3 b1 c2 c3 c1 c2kLevel 3subcluser NewNode

SLIDE 80

(
)

d4 x a2 a3 a4 b4 b3 b1 c2 c3 c1 c2kLevel 3subcluser NewNode d1

SLIDE 81

(
)

d4 x a2 a3 a4 b4 b3 b1 c2 c3 c1 c2kLevel 3subcluser NewNode d1

NewNode

SLIDE 82

(
)

d1 d4 x c3 c2 c1 b1 b3 b4 a2 a3 a4 d1kLevel 4subcluser NewNeighbor

SLIDE 83

(
)

d1 d4 x c3 c2 c1 b1 b3 b4 a2 a3 a4 d1kLevel 4subcluser NewNeighbor

NewNeighbor NewNeighbor

SLIDE 84

(
)

d1 d4 x c3 c2 c1 b1 b3 b4 a2 a3 a4 NewNeighborIP address

SLIDE 85

(
)

d1 d4 x c3 c2 c1 b1 b3 b4 a2 a3 a4 NewNeighborIP address

IP address IP address

SLIDE 86

(
)

d1 d4 x c3 c2 c1 b1 b3 b4 a2 a3 a4 d1kLevel 4subcluser NewNode

SLIDE 87

(
)

d1 d4 x c3 c2 c1 b1 b3 b4 a2 a3 a4 d1kLevel 4subcluser NewNode

NewNode

SLIDE 88

(
)

d1 d4 x c3 c2 c1 b1 b3 b4 a2 a3 a4

xIP addressrouting table

SLIDE 89

[a,b]level i

level i - 1cluster [,]

a – 1 [,], a - 1

, - 1

SLIDE 90

(
)

64 32 48 16 a1 a2 a4 b1 b2 b3 b4

SLIDE 91

(
)

64 32 48 16 a1 a2 a4 b1 b2 b3 b4

b2

SLIDE 92

(
)

64 32 48 16 a1 a2 a4 b1 b3 b4

SLIDE 93

(
)

64 32 48 16 a1 a2 a4 b1 b3 b4

b1

SLIDE 94

(
)

64 32 48 16 a1 a2 a4 b4 b3 b4

SLIDE 95

(
)

64 32 48 16 a1 a2 a4 b4 b3 b4

a4

SLIDE 96

(
)

64 32 16 a1 a2 b4 b3 b4

SLIDE 97

(
)

64 32 16 a1 a2 b4 b3 b4

b3

SLIDE 98

(
)

64 32 16 a1 a2 b4

SLIDE 99

Fault tolerance

Network failure

Failchannelrouting table

k k channel

Node failure

SLIDE 100

Pastry [Rowstron et al. ’01]

128bitID 128bitkeyID

routing

O(log N) hops

CAN [Ratnasamy et al. ’01]

d[0,1][0,1]

O(N1/d) hops

SLIDE 101

Phoenix model on General graphs

P2P Scalable node addressing Scalable message routing

: O(log N) routing table: O(log N)

Network failure(?)

SLIDE 102

cluster

Firewall NAT levelcluster2-hoprouting

?

Node failure

?

SLIDE 103