Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Can Online Social Friends Help to Improve Data Swarming Performance?

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Honggang Zhang ; Math & Comput. Sci. Dept., Suffolk Univ., Boston, MA, USA ; Benyuan Liu ; Xiayin Weng ; Chao Yu

We investigate whether friend relationship in online social networks (OSNs) can help to improve the performance of Peer-to-Peer (P2P) data swarming systems. Due to the importance and popularity of OSNs and P2P swarming (the two major applications on the Internet), the research community shows increasing interest in leveraging OSNs for data swarming system design. In this paper, we present our initial findings about some of the basic issues in this emerging area, which are largely missing from existing work. Specifically, we conduct a measurement study of a popular online social network - Douban [1], and our analysis of this OSN provides strong empirical evidence of the association between users' content interests and their online social friend relationship. Then we introduce a simple public social streaming scheme that lets peers simultaneously join multiple swarms of the same data content with the help from their online social friends. Our simulation studies demonstrate that this social scheme can lead to significant performance improvement in vanilla P2P streaming systems. Furthermore we explore the impact of various social graphs on the performance improvement brought about by the social scheme. Our findings indicate that our proposed social scheme consistently achieves greater performance improvement on Erdos-Renyi's random graphs than on other graphs such as Barabasi-Albert's scale-free graphs and the empirical Facebook and Douban social graphs. This result points to an important research direction of leveraging OSNs in data swarming system design.

Published in:

Computer Communications and Networks (ICCCN), 2012 21st International Conference on

Date of Conference:

July 30 2012-Aug. 2 2012