A Self-Organized Architecture for Efficient Service Discovery in Future Peer-to-Peer Online Social Networks

With the unprecedented growing information services in online social networks (OSNs), Internet users are increasingly struggling to keep pace with the sheer volume of massively unstructured social data being created online through information services on a daily base. However, most of OSNs are based on centralized client-server architecture which can easily suffer from problems such as performance bottleneck and vulnerability to the single point of failure in large-scale networks. Moreover, all the data and services are stored in the service providers' data center, users could lose control of their privacy and ownership of their own data. This visionary paper is to propose a novel self-organized architecture and supporting mechanisms for efficient service discovery in next-generation peer-to-peer (P2P) online social networks which enables dynamic interaction, collaboration, social information sharing and discovering and improve the scalability, availability and efficiency of current centralized OSNs. In the architecture, users have more control over their own private information and have better access to the social network services online and offline.

[1]  Wolfgang Nejdl,et al.  A scalable and ontology-based P2P infrastructure for Semantic Web Services , 2002, Proceedings. Second International Conference on Peer-to-Peer Computing,.

[2]  John Kubiatowicz,et al.  Probabilistic location and routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[3]  Giancarlo Ruffo,et al.  LotusNet: Tunable privacy for distributed online social network services , 2012, Comput. Commun..

[4]  Esteban Moro,et al.  Social Features of Online Networks: The Strength of Intermediary Ties in Online Social Media , 2011, PloS one.

[5]  Nikita Borisov,et al.  Cachet: a decentralized architecture for privacy preserving social networking with caching , 2012, CoNEXT '12.

[6]  Dimitrios Gunopulos,et al.  A local search mechanism for peer-to-peer networks , 2002, CIKM '02.

[7]  Ralf Steinmetz,et al.  LifeSocial.KOM: A secure and P2P-based solution for online social networks , 2011, 2011 IEEE Consumer Communications and Networking Conference (CCNC).

[8]  F. Heider ATTITUDES AND COGNITIVE ORGANIZATION , 1977 .

[9]  Hector Garcia-Molina,et al.  Routing indices for peer-to-peer systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[10]  Christos Doulkeridis,et al.  DESENT: decentralized and distributed semantic overlay generation in P2P networks , 2007, IEEE Journal on Selected Areas in Communications.

[11]  Yuguang Fang,et al.  P2P-iSN: a peer-to-peer architecture for heterogeneous social networks , 2014, IEEE Network.

[12]  Rita H. Wouhaybi,et al.  Building resilient low-diameter peer-to-peer topologies , 2008, Comput. Networks.

[13]  Dimitrios Tsoumakos,et al.  Adaptive Probabilistic Search (APS) for Peer-to-Peer Networks , 2003 .

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

[15]  Paolo Traverso,et al.  Service-Oriented Computing: State of the Art and Research Challenges , 2007, Computer.

[16]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[17]  Ben Y. Zhao,et al.  Understanding latent interactions in online social networks , 2010, IMC '10.

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

[19]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[20]  Michael I. Jordan,et al.  Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..

[21]  Bruce M. Maggs,et al.  Efficient content location using interest-based locality in peer-to-peer systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[22]  Hector Garcia-Molina,et al.  Improving search in peer-to-peer networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[23]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[24]  R. Axtell Zipf Distribution of U.S. Firm Sizes , 2001, Science.

[25]  Geert Deconinck,et al.  A Taxonomy for Resource Discovery , 2004, ARCS.

[26]  Cecilia Mascolo,et al.  Socio-Spatial Properties of Online Location-Based Social Networks , 2011, ICWSM.

[27]  Chen Gui-Hai,et al.  Partition Nodes: Topologically-Critical Nodes of Unstructured Peer-to-Peer Networks , 2008 .

[28]  Christos Politis,et al.  Distributed Hash Tables for Peer-to-Peer Mobile Ad-hoc Networks with Security Extensions , 2012, J. Networks.

[29]  Sam Joseph,et al.  NeuroGrid: Semantically Routing Queries in Peer-to-Peer Networks , 2002, NETWORKING Workshops.

[30]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .

[31]  Matthias Klusch,et al.  Automated semantic web service discovery with OWLS-MX , 2006, AAMAS '06.

[32]  Jaewan Lee,et al.  Intelligent Search Mechanism Based on Neuro-Fuzzy System for the Distributed Object Groups , 2007, IPC.

[33]  Kun Yang,et al.  Mobile Social Networks: Architectures, Social Properties, and Key Research Challenges , 2013, IEEE Communications Surveys & Tutorials.

[34]  Mark S. Granovetter The Strength of Weak Ties , 1973, American Journal of Sociology.

[35]  Murat Yuksel,et al.  Limited Scale-Free Overlay Topologies for Unstructured Peer-to-Peer Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[36]  Sanjiva Weerawarana,et al.  Unraveling the Web services web: an introduction to SOAP, WSDL, and UDDI , 2002, IEEE Internet Computing.

[37]  Refik Molva,et al.  On the Security and Feasibility of Safebook: A Distributed Privacy-Preserving Online Social Network , 2009, PrimeLife.

[38]  Xin Chen,et al.  SCOPE: scalable consistency maintenance in structured P2P systems , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[39]  Zhen-Hua Li,et al.  Partition Nodes: Topologically-Critical Nodes of Unstructured Peer-to-Peer Networks: Partition Nodes: Topologically-Critical Nodes of Unstructured Peer-to-Peer Networks , 2008 .

[40]  Yi Ma,et al.  A P2P Network Topology Optimized Algorithm Based on Minimum Maximum K-Means Principle , 2009, 2009 Ninth International Conference on Hybrid Intelligent Systems.

[41]  Sonja Buchegger,et al.  PeerSoN: P2P social networking: early experiences and insights , 2009, SNS '09.

[42]  Sam Joseph,et al.  P2P MetaData Search Layers , 2003, AP2PC.

[43]  Jennifer Neville,et al.  Modeling relationship strength in online social networks , 2010, WWW '10.

[44]  Yasuhiro Fujiwara,et al.  Fast and Exact Top-k Search for Random Walk with Restart , 2012, Proc. VLDB Endow..

[45]  Hector Garcia-Molina,et al.  Semantic Overlay Networks for P2P Systems , 2004, AP2PC.

[46]  Jie Xu,et al.  Efficient resource discovery in self‐organized unstructured peer‐to‐peer networks , 2009, Concurr. Comput. Pract. Exp..

[47]  Guiran Chang,et al.  Topology Optimization of Mobile P2P Ad Hoc Networks , 2010, 2010 First International Conference on Pervasive Computing, Signal Processing and Applications.

[48]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[49]  Hai Zhuge,et al.  A Virtual Ring Method for Building Small-World Structured P2P Overlays , 2008, IEEE Transactions on Knowledge and Data Engineering.

[50]  Thomas Hofmann,et al.  Unsupervised Learning by Probabilistic Latent Semantic Analysis , 2004, Machine Learning.

[51]  Krishna P. Gummadi,et al.  A measurement study of Napster and Gnutella as examples of peer-to-peer file sharing systems , 2002, CCRV.

[52]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[53]  Eytan Adar,et al.  Free Riding on Gnutella , 2000, First Monday.