Abstract
Social network popularity continues to rise as they broaden out to more users. Hidden away within these social networks is a valuable set of data that outlines everyone’s relationships. Networks have created APIs such as the Facebook Development Platform and OpenSocial that allow developers to create applications that can leverage user information. However, at the current stage, the social network support for these new applications is fairly limited in its functionality. Most, if not all, of the existing internet applications such as email, BitTorrent, and Skype cannot benefit from the valuable social network among their own users. In this paper, we present an architecture that couples two different communication layers together: the end2end communication layer and the social context layer, under the Davis Social Links (DSL) project. Our proposed architecture attempts to preserve the original application semantics (i.e., we can use Thunderbird or Outlook, unmodified, to read our SMTP emails) and provides the communicating parties (email sender and receivers) a social context for control and management. For instance, the receiver can set trust policy rules based on the social context between the pair, to determine how a particular email in question should be prioritized for delivery to the SMTP layer. Furthermore, as our architecture includes two coupling layers, it is then possible, as an option, to shift some of the services from the original applications into the social context layer. In the context of email, for example, our architecture allows users to choose operations, such as reply, reply-all, and forward, to be realized in either the application layer or the social network layer. And, the realization of these operations under the social network layer offers powerful features unavailable in the original applications. To validate our coupling architecture, we have implemented a DSL kernel prototype as a Facebook application called CyrusDSL (currently about 40 local users) and a simple communication application combined into the DSL kernel but is unaware of Facebook’s API.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Banks, L., Bhattacharyya, P., Wu, S.F.: Davis social links: A social network based approach to future internet routing. In: FIST 2009: The Workshop on Trust and Security in the Future Internet (July 2009)
Kleinberg, J.: The small-world phenomenon: An algorithm perspective. In: STOC 2000: Proceedings of the 32nd annual ACM symposium on Theory of computing, pp. 163–170. ACM, New York (2000)
Milgram, S.: The small world problem. Psychology Today 61, 60–67 (1967)
Sandberg, O.: The Structure and Dynamics of Navigable Networks. PhD thesis, Chalmers University (2007)
Spear, M., Lang, J., Lu, X., Wu, S.F., Matloff, N.: KarmaNet : Using social behavior to reduce malicious activity in networks (2008), http://www.cs.ucdavis.edu/research/tech-reports/2008/CSE-2008-2.pdf
OpenSocial, http://www.skype.com/
Golbeck, J., Hendler, J.: Reputation network analysis for email filtering. In: Proceedings of the 1st Conference on Email and Anti-Spam (CEAS) (2004)
Garriss, S., Kaminsky, M., Freedman, M.J., Karp, B., Mazieres, D., Yu, H.: Re: Reliable email. In: Proceedings of the 3rd Symposium on Networked Systems Design and Implementation (NSDI), pp. 297–310 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tran, T. et al. (2009). Design and Implementation of Davis Social Links OSN Kernel. In: Liu, B., Bestavros, A., Du, DZ., Wang, J. (eds) Wireless Algorithms, Systems, and Applications. WASA 2009. Lecture Notes in Computer Science, vol 5682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03417-6_52
Download citation
DOI: https://doi.org/10.1007/978-3-642-03417-6_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03416-9
Online ISBN: 978-3-642-03417-6
eBook Packages: Computer ScienceComputer Science (R0)