Davis Social Links: A Next Generation Communication System - PowerPoint PPT Presentation

1 / 17
About This Presentation
Title:

Davis Social Links: A Next Generation Communication System

Description:

ePost, i3, Secure & Resilient Email, etc. Chord, Pastry, CAN, etc. ... Lookup(K19) K19. Social Links. Chord Links. Chord Social Links. Previous Work. SPROUT ... – PowerPoint PPT presentation

Number of Views:141
Avg rating:3.0/5.0
Slides: 18
Provided by: Ler7
Category:

less

Transcript and Presenter's Notes

Title: Davis Social Links: A Next Generation Communication System


1
Davis Social Links A Next Generation
Communication System
  • Lerone Banks

2
Background/Motivation
  • Problems with Current Communication Systems
  • Email
  • Flooded with Free Spam
  • Domain/DNS Dependent
  • VoIP
  • Text/Voicemail Spam
  • Project Evolution
  • From Email to general communication

3
Main Ideas
  • Separate routing information from identity
  • Provide scalable distribution and control
  • Use social links among peers
  • Trustworthy routing

4
Some Needed Protocols
  • Social link establishment (3rd party service)
  • Routing
  • Penalization scheme
  • Link grading (prioritization)
  • Dynamic network handling
  • Link aggregation
  • Loop avoidance

5
Routing
  • Random K-hop (previous disc.)
  • Other options
  • Structured
  • DHT-based
  • Unstructured
  • Keyword flooding

6
Hashing Random K Hop
  • Receiver will produce a random K Hop message in
    the network
  • Sender will produce a hashed random K Hop message
    to see if it will intersect with the message from
    the receiver
  • Essentially, we use hashing to prune the search
    space
  • If we fail, just retry probability??

7
Hashing Random K Hop
8
DHT-based
  • ePost, i3, Secure Resilient Email, etc.
  • Chord, Pastry, CAN, etc.
  • DHT implementation differences
  • Geometry
  • Neighbor selection
  • Resilience

9
Chord
  • Maps keys to nodes
  • Randomly assign ids to nodes
  • Create sequential ring of nodes
  • Make long links as shortcuts
  • Use greedy routing to find node with closest
    matching id

10
Chord
N5
N10
N110
K19
N20
N99
N32
Lookup(K19)
N80
N60
11
Chord Social Links
N5
N10
N110
K19
N20
N99
N32
Lookup(K19)
N80
N60
Chord Links
Social Links
12
Chord Social Links
  • Previous Work
  • SPROUT (Stanford)
  • Uses social links to find reliable links
  • Trust based on number of hops between A and B in
    social network (I disagree)
  • Degrades to standard Chord when no social links
    are available (No control)

13
DHT Issues
  • Generally efficient
  • O(log n)
  • Questionable Resilience
  • Compromised nodes
  • High churn
  • No service guarantees
  • Less Control

14
Keyword Flooding
  • Social Links based on keywords
  • Similar to LinkedIn, others?
  • Connections made out-of-band or through secure
    communication
  • Negotiation/SLA
  • Use logical expressions over keywords
  • End-to-end routing
  • Forwarding

15
Keyword Flooding
  • Two phases
  • Route Discovery
  • Data communication
  • Also need??
  • Penalty framework
  • Aggregation
  • Route maintenance

16
Route Discovery
  • Sender floods keywords along social links with
    matching expressions
  • Recipients decide whether to forward (accept)
    route request
  • Threshold
  • Grade of link
  • Sender decides which path(s) to use
  • negotiation

17
Data Communication
  • Use 1024 bit ids and public/private keys
  • Human routers prioritize messages
Write a Comment
User Comments (0)
About PowerShow.com