"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
Scaling Online Social Networks (OSNs)
1. Scaling Online Social
Networks (OSNs)
Presented by: Maria Stylianou Coworker: Anis Uddin
Supervisor: Šarūnas Girdzijauskas
KTH - Royal Institute of Technology
Implementation of Distributed Systems
December 6th, 2012
19. JA-BE-JA - Policies
● Sampling ● Swapping
– Local – Energy Function
● Select neighbors ● Reach minimum
– Random – Simulated Annealing
● Select from random ● Escape from local
walk optima
– Hybrid
● Local & Random
Source: http://socialnetworking.lovetoknow.com/Growth_of_Online_Social_Networking_in_Business
Motivation-Algorithms-Contribution-Evaluation 19
21. Challenges
Global View
Partition Manager requirement
→ Single Point
of Failure
SPAR
SPAR
Replication
Overhead
Motivation-Algorithms-Contribution-Evaluation 21
22. Our Solution
Global View
Partition Manager requirement
→ Single Point
of Failure SPAR Local View
Distributed
&
Partition JA-BE-JA
Manager
Replication
Overhead
Motivation-Algorithms-Contribution-Evaluation 22
23. Our Solution
(wait for it...)
Client Requests
SPAR
Data Store
Servers
Motivation-Algorithms-Contribution-Evaluation 23
24. Our Solution
Client Requests
SPAR
&
JA-BE-JA
JA
BE
JA
Data Store
Servers
Motivation-Algorithms-Contribution-Evaluation 24
32. Experiments
Replication Overhead on both algorithms
Fault Tolerance
K=2
fcbk-3:
- 3rd facebook graph
- 60,000 edges
Motivation-Algorithms-Contribution-Evaluation 32
33. Conclusions
● SPAR + JA-BE-JA = SPAR-JA
– Highly clustered nodes
– Achieves fault tolerance 'by-default'
– Better than SPAR in case of high clusterization
● Future Work
– More datasets
– Bigger datasets
Motivation-Algorithms-Contribution-Evaluation 33
34. Scaling Online Social
Networks (OSNs)
Presented by: Maria Stylianou Coworker: Anis Uddin
Supervisor: Šarūnas Girdzijauskas
KTH - Royal Institute of Technology
Implementation of Distributed Systems
December 6th, 2012