Trust Aware Social Networking: A Distributed Storage System based on Social Trust and Geographical Proximity

The popularity of online social network services such as Facebook and StudiVZ has been steadily increasing over the last years. User numbers of Facebook are expected to soon exceed the 150 Million user threshold. Thousands of new users register an account every day and fill the data bases of network providers with new private data. Reports on security breaches and new marketing concepts for user data diminish the trust placed in these providers. In order to gain back the user’s control over private data, Sonja Buchegger et al. [21] proposed to use a community-driven P2P solution for social network services. To date only few P2P implementations have been used. None of them incorporates security measures based social trust or provides strong availability qualities. The present diploma thesis incorporates this idea and extends it by implementing it on DSL-Routers and adding a special consideration of social trust. I base trust on social relations to support secure data exchanges and storage. The scope of this thesis includes the analysis of the system requirements, the derived software architecture and a fully working prototype that fulfills these requirements. Clique is the implementation of this architecture and is presented and evaluated as part of this work. It is shown that the software architecture is feasible to implement and deploy on a DSL-Router using the Mono runtime. I demonstrate the possibility to replace existing online social networks by implementing alternative architectures, such as Clique. Clique is a complement to current solutions and allows users to manage their private data while keeping benefits such as availability and safe storage of the information.

[1]  H KatzRandy,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988 .

[2]  Pierre Sens,et al.  Pastis: A Highly-Scalable Multi-user Peer-to-Peer File System , 2005, Euro-Par.

[3]  Ben Y. Zhao,et al.  Tapestry: a fault-tolerant wide-area application infrastructure , 2002, CCRV.

[4]  Srinivasan Seshan,et al.  Mercury: supporting scalable multi-attribute range queries , 2004, SIGCOMM '04.

[5]  Tim Kindberg,et al.  Distributed Systems: Concepts and Design (4th Edition) (International Computer Science) , 2005 .

[6]  Dennis Shasha,et al.  The dangers of replication and a solution , 1996, SIGMOD '96.

[7]  Wilhelm Hasselbring,et al.  Trustworthy software systems: a discussion of basic concepts and terminology , 2006, SOEN.

[8]  Zoe Antoniou,et al.  A hybrid P2P/Infrastructure platform for personal and social Internet services , 2008, 2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications.

[9]  Gang Peng,et al.  CDN: Content Distribution Network , 2004, ArXiv.

[10]  Randy H. Katz,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.

[11]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[12]  Max Van Kleek,et al.  MyNet: A Platform for Secure P2P Personal and Social Networking Services , 2008, 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom).

[13]  Tammy Noergaard,et al.  Embedded systems architecture - a comprehensive guide for engineers and programmers , 2005 .

[14]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[15]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[16]  George Varghese,et al.  Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications , 2001, SIGCOMM 2001.

[17]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[18]  John Kubiatowicz,et al.  Erasure Coding Vs. Replication: A Quantitative Comparison , 2002, IPTPS.

[19]  Malcolm P. Atkinson,et al.  Evaluating Usability Aspects of PJama Based on Source Code Measurements , 1998, POS/PJW.

[20]  Karl Aberer,et al.  Improving Data Access in P2P Systems , 2002, IEEE Internet Comput..

[21]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[22]  George Coulouris,et al.  Distributed systems - concepts and design , 1988 .

[23]  Andrew B. Whinston,et al.  P2P Networking: An Information-Sharing Alternative , 2001, Computer.

[24]  Jennifer Golbeck,et al.  Computing and Applying Trust in Web-based Social Networks , 2005 .

[25]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[26]  Robert Tappan Morris,et al.  Persistent personal names for globally connected mobile devices , 2006, OSDI '06.

[27]  Robert Tappan Morris,et al.  Ivy: a read/write peer-to-peer file system , 2002, OSDI '02.

[28]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[29]  尚弘 島影 National Institute of Standards and Technologyにおける超伝導研究及び生活 , 2001 .

[30]  Karl Aberer,et al.  P-Grid: a self-organizing structured P2P system , 2003, SGMD.

[31]  J. A. Barnes Class and Committees in a Norwegian Island Parish , 1954 .

[32]  Sonja Buchegger,et al.  A case for P2P infrastructure for social networks - opportunities & challenges , 2009, 2009 Sixth International Conference on Wireless On-Demand Network Systems and Services.

[33]  Michael Barr,et al.  Programming embedded systems - with C and GNU development tools: thinking inside the box: includes real-time and Linux examples (2. ed.) , 2006 .