1.16k likes | 1.34k Views
Davis Social Links. S. Felix Wu Computer Science Department University of California, Davis wu@cs.ucdavis.edu http://www.cs.ucdavis.edu/~wu/. Internet Architecture & Routing. Applications with Tests. Internet Architecture & Routing.
E N D
Davis Social Links S. Felix Wu Computer Science Department University of California, Davis wu@cs.ucdavis.edu http://www.cs.ucdavis.edu/~wu/
Internet Architecture & Routing Applications with Tests
Internet Architecture & Routing • Any identity (email address, IP, url) can communicate with any one else. • Email, web, bittorrent, warcraft, skype…
Social-Control Routing Applications with Tests 3 2 1
The value of the “Network” • A concern about a network losing its “value” • while we are unsure about how to quantify the true value…
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.
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.
Facebook versus Personal Web Site • WWW: everybody can see it • Facebook: a selected set of people on your social network can see it
Activities, Knowledge Sharing, and Social Relationship Scalability, Privacy, Trust, Robustness, Performance…
Social Network Applications • Social-based collaborative filtering • Recommendation • Privacy-control • Advertising
Urgent! Please contact me! FROM:MR.CHEUNG PUI Hang Seng Bank Ltd Sai Wan Ho Branch 171 Shaukiwan Road Hong 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 calendar months, 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,…
This was considered a spam! Sometimes, the cost of False Positive may be very high…
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
“Social Spams” • They might not be spams as we often overlooked the social values of them!
Motivations • The value of social communication • To leverage • To protect
Communicate: [A, D] B D A C As long as “A” knows “D’s routable identity”
[A,D] + social context B D A C “A” has to explicitly declare if there is any social context under this communication activity with “D”!
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
“Optimality” • Not necessarily “the shortest path” • Social context consideration
CyrusDSL • How do we accomplish these features? • How do we realize the concepts scaleable? • How will this system work against spams?
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)
[A,D] + social context ?? B D A C “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!
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)
Re-wiring (Watts/Strogatz) Structured/Clustered 62 35 Trade off between D and Ccluster !
Routing in a Small World • Common question: do short paths exist? • Algorithmic question: assuming short paths exist. How do people find them?
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:
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”.