Characterizing Chord, Kelips and Tapestry algorithms in P2P streaming applications over wireless network - PowerPoint PPT Presentation

1 / 27
About This Presentation
Title:

Characterizing Chord, Kelips and Tapestry algorithms in P2P streaming applications over wireless network

Description:

Title: PowerPoint Presentation Last modified by: TIGER-XP Created Date: 1/1/1601 12:00:00 AM Document presentation format: Other titles – PowerPoint PPT presentation

Number of Views:117
Avg rating:3.0/5.0
Slides: 28
Provided by: makingCsi
Category:

less

Transcript and Presenter's Notes

Title: Characterizing Chord, Kelips and Tapestry algorithms in P2P streaming applications over wireless network


1
Characterizing Chord, Kelips and Tapestry
algorithms in P2P streaming applications over
wireless network
  • Hung Nguyen Chan, Khang Nguyen Van, Giang Ngo
    Hoang
  • Communications and Electronics, 2008. ICCE 2008.
  • Second International Conference on 2008-06-041
    Dai Co Viet Str, Hanoi Univ. of Technol., Hanoi
  • Reporter 69721009 ???

  • 69721035 ???

2
Outline
  • Abstract
  • Introduction
  • Experimental Parameters
  • Results and Discussion
  • Concluding Remarks

3
Abstract
  • P2P streaming applications
  • flexibility, efficiency and self-scalability
    of P2P network
  • Challenging task
  • Intermittent nature of wireless link and the
    energy-saving mechanisms of mobile devices

4
Introduction
  • DHT (Distributed Hash Table) algorithm
  • Chord
  • Kelips
  • Tapestry

5
DHT
  • ?????????????????????????????????,??????? (Binary
    search tree) ??????
  • ??????????????????,????????????????,??????????
  • ??????,????????????????

6
Chord
  • ???hash function?key?????Chord????????
  • ??node????O(log N)????????,?????????????O(log
    N)????,??????
  • ????????,??????????????????(Finger
    table),???ID????

7
Chord
8
(No Transcript)
9
Kelips
  • ?????,????O(1)
  • Affinity Group View ??????Affinity Group
    ???????,id,hbead,rtt???
  • Contacts ??????Affinity Group?????????,??contactn
    odes?????Affinity Group??????????ID
  • Filetuple ??????,homenode????????,???homenode????
    ????Affinity Group??,??????????????

10
Kelips
11
Tapestry
Tapestry routing mesh from the perspective a
single node
12
Tapestry
  • Neighbor maps to route overlay message to the
    destination ID digit by digit (4?42?42A?42AD
    )

13
Tapestry
Path of a message 5230?42AD
14
Experimental Parameters
  • ?????????
  • 1.Chord?Kelips?Tapetry???????????
  • ? input?
  • 2.????????????,????????
  • ?????????????????
  • ???????100?250?500?750?1000??????,??2??RTT
    (roundtrip time)?????????????

15
Experimental Parameters (Cont.)
  • ????????,??????????????
  • ???Churn rate???,?????????????????
  • ???????????????????????10??600?(10??)?????????????
    ?
  • ???????????????????,????????60???????????
  • ???????????Chord?Kelips?Tapestry????

16
Experimental Parameters (Cont.)
17
Results and Discussion
  • ?1??5????1?????,X???live nodes??????????????(Bytes
    /sec),Y??????????????????????????????Convex hull??

18
Results and Discussion (Cont.)
19
(No Transcript)
20
(No Transcript)
21
Results and Discussion (Cont.)
22
(No Transcript)
23
(No Transcript)
24
Results and Discussion (Cont.)
25
(No Transcript)
26
(No Transcript)
27
Results and Discussion (Cont.)
28
(No Transcript)
29
(No Transcript)
30
Results and Discussion (Cont.)
31
(No Transcript)
32
(No Transcript)
33
Results and Discussion (Cont.)
34
(No Transcript)
35
(No Transcript)
36
Results and Discussion (Cont.)
37
Concluding remarks
  • ?Churn rate???120?????,Tapestry????????Chord?Kelip
    s???Churn rate???300????,Chord???????
  • ???????(Round Trip Time, RTT)???,Tapestry?Kelips?C
    hord?????
  • Chord?Tapestry??Churn rate??????????(??????????Cho
    rd???)?
  • Churn rate???????????,??????????median lookup
    latency??????

38
Concluding remarks (Cont.)
  • ??Chord??????????,????????????????????????,???????
    ????????,???Chord?????????????Kelips?Tapestry?Chor
    d????????????????????????????????

39
  • Thank you
Write a Comment
User Comments (0)
About PowerShow.com