Post on 13-Jan-2016
1
Davis Social Links
S. Felix WuComputer Science DepartmentUniversity of California, Davis
wu@cs.ucdavis.eduhttp://www.cs.ucdavis.edu/~wu/
2
Internet Architecture & Routing
Applications with Tests
3
Internet Architecture & Routing
• Any identity (email address, IP, url) can communicate with any one else.– Email, web, bittorrent, warcraft, skype…
4
Social-Control Routing
Applications with Tests
12
3
5
6
7
The value of the “Network”
• A concern about a network losing its “value”– while we are unsure about how to quantify the true value…
8
Open Issues
• What is the “value” of this social network?
• How would this “value” be distributed and allocated to each individual peers?
• MySpace, Facebook, LinkedIn didn’t define the “game” for network formation and value allocation.– But, it is important to design the game such that the OSN will eventually converge to a state to best support the communities.
9
Social Network Games
10
Fighter’s Club
• A Coalition game ~ like Warcraft• Team members who are Facebook friends receive higher fighting powers
• ~1400 new friendships established daily
• ~10% of users with >95% friendships purely based on this game.
11
Facebook versus Personal Web Site
• WWW: everybody can see it• Facebook: a selected set of people on your social network can see it
12
13
14
15
16
Activities, Knowledge Sharing, and Social Relationship
Scalability, Privacy, Trust, Robustness,Performance…
17
Social Network Applications
• Social-based collaborative filtering
• Recommendation• Privacy-control• Advertising
18
Urgent! Please contact me!
FROM:MR.CHEUNG PUIHang Seng Bank LtdSai Wan Ho Branch171 Shaukiwan RoadHong Kong.
Please contact me on my personal box [puicheungcheungpui@yahoo.com]
Let me start by introducing myself. I am Mr. Cheung Pui, director of operations of the Hang Seng Bank Ltd,Sai Wan Ho Branch. I have a obscured business suggestion for you.
Before the U.S and Iraqi war our client Major Fadi Basem who was with the Iraqi forces and also business man made a numbered fixed deposit for 18 calendarmonths, with a value of Twenty Four millions Five Hundred Thousand United State Dollars only in my branch. Upon maturity several notice was sent to him,…
19
http://www.ebolamonkeyman.com/cheung.htm
20
Pick your favor Spam Filter(s)
21
This was considered a spam!
22
This was considered a spam!
Sometimes, the cost of False Positive may be very high…
23
The Implication of FP’s
• Spam-filters have to be conservative…
• We will have some false negatives in our own inboxes.
• We will use our own time to further filter..– For me, 1~2 seconds per email
24
The emails I received just THIS morning…
25
You have about 1 second to decide……
26
27
28
29
“ Social Spams”
• They might not be spams as we often overlooked the social values of them!
30
Motivations
• The value of social communication– To leverage– To protect
31
Communicate: [A, D]
A
B
C
D
As long as “A” knows “D’s routable identity”
32
Hijackable Routable Identify
33
[A,D] + social context
A
B
C
D
“A” has to explicitly declare if there is any social context under this communication activity with “D”!
34
Internet & Routable Identity
• URL, IP address, email,….– For ANYWHERE in the Internet
• Without Routable Identity– Only available to certain parts of Social Networks
• Using OSN to perform access control
35
36
Who is Salma?
37
Who is Salma?
38
Who is Salma?
39
My message to Salma
40
The Social Path(s)
41
“ Optimality”
• Not necessarily “the shortest path”– Social context consideration
42
More Examples
43
CyrusDSL
• How do we accomplish these features?
• How do we realize the concepts scaleable?
• How will this system work against spams?
44
Just a couple issues …
• How to establish the social route?– How would “A” know about “D” (or “D’s identity”) ?
• How to maintain this “reputation network”?– MessageReaper: A Feed-back Trust Control System (Spear/Lang/Lu)
45
[A,D] + social context
A
B
C
D
“A” has to explicitly declare if there is any social context under this communication activity with “D”! But, “D” only cares if it is from “C” or not!
??
46
Search on “OSN”
• How to get to from ?
• The Small world model– 6 degree separation (Milgram, 1967)– “existence of a short path”– How to find the short path? (Kleinberg, 2000)
47
Re-wiring (Watts/Strogatz)
Trade off between D and Ccluster !
Structured/Clustered
62
35
48
Routing in a Small World
• Common question: do short paths exist?
• Algorithmic question: assuming short paths exist. How do people find them?
49
Kleinberg’s results
A decentralized routing problem– For nodes s,t with known lattice coordinates, find a short path from s to t.
– At any step, can only use local information,
– Kleinberg suggests a simple greedy algorithm and analyzes it:
50
Kleinberg’s Model
• Use only Local information, except the distance to the target.– However, what is the “global distance” in cyber space? Yet, the assumption behind is that the “edges” depend on the “relative distance”.
51
• How will we tell whether the relative distance between X&Y is closer than X&Z?– X, Y, Z (assuming they are all direct friends to each other)
• One simple idea: “Keyword intersection”– KW(X), KW(Y), KW(Z)– 1/(#[KW(a) KW(b)] + 1)
– Will this work? How about global distance?
X, Y, and Z
52
Similarity
53
Similarity
54
Social Route Discovery for A2D
A
B
C
D
Let’s assume A doesn’t have D’s “routable identity”Or, “D” doesn’t have a global unique identity!Then, how can we do A2D?
??
55
Finding
A
B
C
D
A2D, while D is McDonald’s!D would like “customers” to find the right route.“idea: keyword propagation” e.g., “McDonald’s”
??
56
Announcing
A
B
C
D
Hop-by-hop keyword propagation
K: “McDonald’s”
57
Announcing
A
B
C
D
Hop-by-hop keyword propagation
K: “McDonald’s”
K: “McDonald’s”
58
Announcing
A
B
C
D
Hop-by-hop keyword propagation
K: “McDonald’s”
K: “McDonald’s”
K: “McDonald’s”
59
Announcing
A
B
C
D
Hop-by-hop keyword propagation
And, I know I am doing FLOODING!!
K: “McDonald’s”
K: “McDonald’s”
K: “McDonald’s”
60
Now Finding
A
B
C
D
Search Keyword: “McDonald’s”A might know D’s keyword via two channels(1) Somebody else (2) From its friendsQuestions: does D need an identity? Scalable?
K: “McDonald’s”
K: “McDonald’s”
K: “McDonald’s”
Q: McDonald’s
61
62
Application Tests
• Example 1: credential-oriented– “PKI certificate” as the keyword– If you can sign or decrypt the message, you are the ONE!
• Example 2: service-oriented– Service/protocol/bandwidth support
• Example 3: offer-oriented– Please send me your coupons/promotions!
63
“ Routable Identity”
• Application identity =M=> Network identity
• Network identity =R=> Network identity
• Network identity =M=> Application identity
64
“ App/Route Identity”
• Application identity =M=> Network identity
• Network identity =R=> Network identity• Network identity =M=> Application identity
• Keywords =(MF-R)=> “Multiple Paths”• Application identity selection• Network route selection
65
Finding
Search Keyword: “McDonald’s”Questions: is this the right Felix Wu’s?How to avoid/control flooding??
A
B
C
D
K: “McDonald’s”
K: “McDonald’s”
K: “McDonald’s”
Q: McDonald’s
Application Test
66
Scalability - Avoid the Flooding
• As it is, every keyword will need to be propagated to all the nodes/links (but the same keyword will be propagated through the same link once possibly with different policies).
• The issue: “who should receive my keywords?”
67
in Community of Davis
A
B
C
D
Who should receive the keyword announcement for “McDonald’s”?
??
68
as the Social Peer
• Attributes:– {McDonald’s Express, 640 W Covell Blvd, # D, Davis, (530) 756-8886, Davis Senior High School, Community Park, North Davis}
69
“ Per-Keyword Policy”
• For each keyword, we will associate it with a propagation policy: [T, N, A]– T: Trust Value Threshold– N: Hop counts left to propagate (-1 each step)
– A: Community Attributes
• Examples:– [>0.66, 4, “Davis”] K via L1
– [>=0, , ] K via L2
70
Scalability & Controllability
• McDonald’s doesn’t want to flood the whole network– It only wants to multicast to the “Target set” of customers
• And, it only wants this target set of users being able to use that particular keyword to contact.– Receiver/owner controllability
71
Social/Community Attributes
A
B
C
D
Who should receive the keyword announcement for “McDonald’s”? Answer:
??
72
Community
A
B
C
D
??
73
Community
• A connected graph of social nodes sharing a set of community attributes
74
Community
A
B
C
D
??
75
Social/Community Attributes
A
B
C
D
Who should receive the keyword announcement for “McDonald’s”? Answer: but not ALL
??
76
Community
A
B
C
D
??
77
Network Formation
A
B
C
D
??
78
Network Formation
A
B
C
D
??
Both A & C: why would A & C be willing to establish a direct friendship?
79
Open Issues
• What is the “value” of this social network?
• How would this “value” be distributed and allocated to each individual peers?
80
Fighter’s Club
• A Coalition game ~ like Warcraft• Team members who are Facebook friends receive higher fighting powers
• ~1400 new friendships established daily
• ~10% of users with >95% friendships purely based on this game.
81
wu@cs.ucdavis.edu +
A
B
C
D
Who should receive the keyword announcement for “wu@cs.ucdavis.edu”? Answer:
??
K: “wu@…” + Policy
82
Even if “A” claims
A
B
C
D
Who should receive the keyword announcement for “wu@cs.ucdavis.edu”? Answer:
??
K: “wu@…”
83
“ B” can help…
A
B
C
D
What is B’s incentive? What is B’s risk?
??
K: “wu@…”
84
Message Value & Prioritization
Application IDS
Link RanksReputationIncentives
Other Trust Metrics
[good, bad] messages
85
Reputation
• Adding “Trust” as another consideration in routing
• Per-packet Reputation Update• Fast Stabilization• Mobility without per-hop authenticated Global/Unique Network layer Identities
86
Reputation on Feed-back
A
B
C
D
“D” is the one to decide whether the message from A/B/C is good or bad!
??
87
One Route path from A to D
Pkt[a>d]
End2End Trust: “is this really from A?”
RoutePath Trust: “Should this path be used?”
A B C D
88
Basic Assumption about the Link
Pkt[a>d]
B & C have a way to decide whether they should establish a link between them, and they can authenticate each other:
Secure MAC authenticationSocial Links in OSNReputation-based AuthenticationSybil Attack robustness
A B C D
89
The Attack Model• Does the receiver really like this packet being delivered to me over a route path of links:– Corrupted information– Spam– An incorrectly E2E-Authenticated packet– Malware
• Assumption: the receiver has its own security policy to determine whether it like the packet/message or not!
90
D decides, and rewards/punishes…
A B C DPkt[c>d]
Trust(D>C)Pkt[bcd]
Trust(C>B)Pkt[abc]
Trust(B>A)Pkt[ab]
91
Trust Structure
We want to stabilize these decentralized values such that they can be used to effectively choose the “best” route.
92
Game Theory Analysis
A B C DPkt[c>d]
Trust(D>C)Pkt[bcd]
Trust(C>B)Pkt[abc]
Trust(B>A)Pkt[ab]
Value Allocation: if a bad message is delivered, how should we distribute the “damage” along the route path?
93
Trust Structure as the Utility
We want to stabilize these decentralized values such that they can be used to effectively choose the “best” route.
94
Three Trust Values per Relationship
• Ta(u,v): u is directly connected to v. How much u trusts v?
• Ainit: v, as the initiator, sends a packet to u.
• Afwd: v forwards a packet to u . I.e., v is not the initiator of the packet.
• Art: sends a packet to, and, v forwards that packet to one of its other neighbors. And, the packet eventually reaches the destination.
u v
95
Example
96
97
Routing with Trust
98
99
1000 nodes, 20% bad
100
1000 nodes, 10%/40% bad
101
Increasing the Spammers
102
Orkut (15329 nodes)
103
Open Issues
• What is the “value” of this social network?
• How would this “value” be distributed and allocated to each individual peers?
• MySpace, Facebook, LinkedIn didn’t define the “game” for network formation and value allocation.– But, it is important to design the game such that the OSN will eventually converge to a state to best support the communities.
104
Social Network Development
• Social Graph• User-defined keywords and attributes
• DSL server • Trust Routing Protocol
DSL
105
DSL is an old idea!
We, as human, have been using similar communication principles. Maybe it is a good opportunity to re-think about our cyber communication system.
Identity is a per-application, context-oriented, and sometime relative issue.
Forming cyber communities of interests for application.
A B
A BF
FF
106
DSL, Facebook, AL-BGP and GENI
AL-BGP over GENI/PlanetLab
http://www.geni.net/DSLport
Each DSL/FB user should select a “closer” GENI entrance as www.geni.net. In other words, we might need to set up DNS records correctly.
107
DSL Architecture
AL-BGP
DSL
Applications with Tests
108
Link
Applications with Tests
12 3
4
109
AS-oriented Social Mapping
Applications with Tests
110
Control versus Data Path
Applications with Tests
data path
control path
12
111
Social-Control Routing
Applications with Tests
12
3
112
Easy to Send & Receive
•Easy for both the good users and the spammers. (fair simplicity)
•The spammers abuse the “sending” right, while the good users have very limited options to counter back.–how easy can we change our email address?
–how often do we need to do that?•A “receiver” or “the owner of the identity” should have some control.–But, that means also “burden” to the users.
113
Easy to Send & Receive
•Easy for both the good users and the spammers. (fair simplicity)
•The spammers abuse the “sending” right, while the good users have very limited options to counter back.–how easy can we change our email address?
–how often do we need to do that?•A “receiver” or “the owner of the identity” should have some control.–But, that means also “burden” to the users.
114
Davis Social Links
• Peer-to-Peer System (P2P)– How human socially communicate?
• Online Social Network (OSN)– How to utilize OSN to enhance communication?
– How to have a securer OSN?
• Autonomous Community (AC)– How to build/develop more effective community-based social networks?
115
AcknowledgementA B
A BF
FF