Enhancing Online Communities with Cycle-Sharing for Social Networks

The Internet has made it possible to exchange information more rapidly on a global scale. A natural succeeding step was the creation of Social Networks where anyone in the world can share their experiences, content, and current information, using only their Internet-enabled personal computer or mobile devices. Under this scope, there are many Social Networks such as Facebook, Orkut, and Youtube each one exporting its own APIs to interact with its users and groups databases. Studies done on Social Networks show that they follow some properties like the Small-World property. Meaning that traversing friendship relations, vast numbers of other users could be reached from each single user (e.g., Friends of Friends), even though users usually only interact (on a daily basis) with a restrict group of friends. Considering that these networks could be regarded as enablingpeer-to-peer information sharing (albeit mediated by a centrally controlled infrastructure), employing them for cycle-sharing should be a great improvement for global distributed computing, by allowing public-resource sharing among trusted users and within online virtual communities. Resources from these types of networks can be used to further advance studies in other areas which may be too computational intensive for using a single computer or a cluster, e.g., to process data mined from the various Social Networks. We describe the design, development, and resulting evaluation of a web-enabled platform, calledCSSN: Cycle-Sharing in Social Networks. The platform leverages a Social Network (Facebook) to perform discovery of computational resources, thus giving the possibility for any user to submit his own jobs for remote processing. Walls, messages, and comments in Facebook are used as the underlying transport for CSSN protocol messages, achieving full portability with existing Social Networks. Globally, CSSN gives the chance for common users to unleash the untapped computing power hidden in Social Networks, and exploit it using the cycle-sharing paradigm to speedup their own (or common) applications’ execution.

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

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

[3]  S. Shostak.  Sharing the Universe: Perspectives on Extraterrestrial Life , 1998 .

[4]  Randy H. Katz,et al.  A view of cloud computing , 2010, CACM.

[5]  Gurmeet Singh Manku,et al.  Routing networks for distributed hash tables , 2003, PODC '03.

[6]  David P. Anderson,et al.  SETI@home: an experiment in public-resource computing , 2002, CACM.

[7]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Vijay S. Pande,et al.  Folding@Home and Genome@Home: Using distributed computing to tackle previously intractable problem , 2009, 0901.0866.

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

[10]  Ian T. Foster,et al.  Grid Services for Distributed System Integration , 2002, Computer.

[11]  Tom A. B. Snijders,et al.  Social Network Analysis , 2011, International Encyclopedia of Statistical Science.

[12]  Jon M. Kleinberg,et al.  Group formation in large social networks: membership, growth, and evolution , 2006, KDD '06.

[13]  Nazareno Andrade,et al.  A Reciprocation-Based Economy for Multiple Services in Peer-to-Peer Grids , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[14]  Dave Stainforth,et al.  Climateprediction.net: Design Principles for Publicresource Modeling Research , 2002, IASTED PDCS.

[15]  Gianluca Mazzini,et al.  Distributed Computing Through Web Browser , 2007, 2007 IEEE 66th Vehicular Technology Conference.

[16]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[17]  Luís Veiga,et al.  Incentive mechanisms in peer-to-peer networks , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW).

[18]  Roy T. Fielding,et al.  Principled design of the modern Web architecture , 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium.

[19]  David P. Anderson,et al.  BOINC: a system for public-resource computing and storage , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[20]  Pierre St. Juste,et al.  Integrating Overlay and Social Networks for Seamless P2P Networking , 2008, 2008 IEEE 17th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises.

[21]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[22]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[23]  Honghui Lu,et al.  Peer-to-peer support for massively multiplayer games , 2004, IEEE INFOCOM 2004.

[24]  Luís Veiga,et al.  nuBOINC: BOINC Extensions for Community Cycle Sharing , 2008, 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops.

[25]  Nick Antonopoulos,et al.  Social Peer-to-Peer for Resource Discovery , 2007, 15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07).

[26]  Kyle Chard,et al.  Social Cloud: Cloud Computing in Social Networks , 2010, 2010 IEEE 3rd International Conference on Cloud Computing.

[27]  Danny Goodman,et al.  Dynamic Html: The Definitive Reference , 1998 .

[28]  Rakesh Kumar,et al.  Understanding KaZaA , 2004 .

[29]  Diomidis Spinellis,et al.  A survey of peer-to-peer content distribution technologies , 2004, CSUR.

[30]  Dimitrios Tsoumakos,et al.  A Comparison of Peer-to-Peer Search Methods , 2003, WebDB.

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

[32]  Krishna P. Gummadi,et al.  Exploiting Social Networks for Internet Search , 2006, HotNets.

[33]  Ben Y. Zhao,et al.  User interactions in social networks and their implications , 2009, EuroSys '09.

[34]  Marios D. Dikaiakos,et al.  A Feedback-Based Approach to Reduce Duplicate Messages in Unstructured Peer-To-Peer Networks , 2007 .

[35]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[36]  Domenico Talia,et al.  Peer-to-Peer resource discovery in Grids: Models and systems , 2007, Future Gener. Comput. Syst..

[37]  Dave Crane,et al.  Ajax in Action , 2005 .

[38]  Luís Veiga,et al.  Service and resource discovery in cycle-sharing environments with a utility algebra , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).

[39]  Luís Veiga,et al.  GiGi: An Ocean of Gridlets on a "Grid-for-the-Masses" , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).