Churn-Resilient Protocol for Massive Data Dissemination in P2P Networks

(Hop Count)(hop count)()

33Outline(INTRODUCTION)

(RELATED WORK)

(PROXIMITY-AWARE OVERLAY NETWORKS)

(NODE JOINING AND DEPARTURES)

(OVERLAY UPDATE OPERATIONS)

(MULTIsOURCE DATA DISSEMINATION)

(SIMULATED EXPERIMENTAL RESULTS)

(CONCLUSIONS)

2(INTRODUCTION)

peer-to-peer (P2P)IP

3(INTRODUCTION)Peer-to-Peer(P2P)

(churn-resilient protocol, CRP)

4(INTRODUCTION)CRP-enabled

CRP-enabled

CRP(scope flooding)(tree traversing)

5(INTRODUCTION)1.CRP- enabled

2.CRP28~50%(scope flooding)(epidemic broadcast trees)

3.40%CRP

4.10000CRP1/3CAM-Chord6(RELATED WORK)(push-based)(pull-based)

CRPpush

7(PROXIMITY-AWARE OVERLAY NETWORKS)(capacity)

(capacity)

Chord

8(PROXIMITY-AWARE OVERLAY NETWORKS)9(PROXIMITY-AWARE OVERLAY NETWORKS)CRP(network proximity)IP

(capacity proximity)

(root)(hop count)

10(PROXIMITY-AWARE OVERLAY NETWORKS) 11(PROXIMITY-AWARE OVERLAY NETWORKS)Capacity A3 B4 C2 D3 E4

12(NODE JOINING AND DEPARTURES)

(predecessor) (successor)

(n+1) x1/n

13(NODE JOINING AND DEPARTURES)14(OVERLAY UPDATE OPERATIONS)(ex,y)xy Network Proximity Weight (NPW)

Capacity Proximity Weight (CPW)

c(x,y) = | cx -cy |

1515(OVERLAY UPDATE OPERATIONS)Proximity Weight (PW)

S={(x,y),(r,s)}

1616(OVERLAY UPDATE OPERATIONS) b=15

(Neighborhood Operations)

17(OVERLAY UPDATE OPERATIONS)

18(OVERLAY UPDATE OPERATIONS)

(neighborhood transition)19(OVERLAY UPDATE OPERATIONS)20

(OVERLAY UPDATE OPERATIONS)PW(S1) e(x.xf) and e(y.yf) PW(S2) e(x,y) and e(xf.yf)

21(MULTIsOURCE DATA DISSEMINATION)(scope-flooding)(tree traversing)

a.CRP22(MULTIsOURCE DATA DISSEMINATION)

23(MULTIsOURCE DATA DISSEMINATION)

24(SIMULATED EXPERIMENTAL RESULTS)P2PCRPCAM-chordACOMGoCastPlumtree

20000P2P

25(SIMULATED EXPERIMENTAL RESULTS)

26(SIMULATED EXPERIMENTAL RESULTS)

27(SIMULATED EXPERIMENTAL RESULTS)

28(SIMULATED EXPERIMENTAL RESULTS)

29(CONCLUSIONS)CRPP2P

(scope flooding)(tree traversing)

CRP28-50%1%40%

30END 3Q3132

32