Title :
Accelerating peer-to-peer file sharing with social relations: Potentials and challenges
Author :
Wang, Haiyang ; Wang, Feng ; Liu, Jiangchuan
Author_Institution :
Simon Fraser Univ., Burnaby, BC, Canada
Abstract :
Peer-to-peer file sharing systems, most notably Bit-Torrent (BT), have achieved tremendous success among Internet users. Recent studies suggest that long-term relationships among BT peers could be explored for peer cooperation, so as to achieve better sharing efficiency. However, whether such long-term relationships exist remain unknown. From an 80-day trace of 100, 000 real world swarms, we find that less than 5% peers can meet each other again throughout the whole period, which largely invalidates the fundamental assumption of these peer cooperation protocols. Yet the recent emergence of online social network applications sheds new light on this problem. In particular, a number of BT swarms are now triggered by Twitter, reflecting a new trend for initializing sharing among communities. In this paper, we for the first time examine the challenges and potentials of accelerating peer-to-peer file sharing with Twitter social networks. We show that the peers in such swarms have stronger temporal locality, thus offering great opportunity for improving their degree of sharing. We further demonstrate a practical cooperation protocol that utilizes the social relations. Our PlanetLab experiments indicate that the incorporation of social relations remarkably accelerates the downloading time.
Keywords :
Internet; peer-to-peer computing; social networking (online); BT swarms; Bit-Torrent; Internet users; PlanetLab experiments; Twitter social networks; long-term relationships; online social network applications; peer cooperation protocols; peer-to-peer file sharing acceleration; peer-to-peer file sharing systems; social relations; Acceleration; Communities; Internet; Peer to peer computing; Protocols; Twitter;
Conference_Titel :
INFOCOM, 2012 Proceedings IEEE
Conference_Location :
Orlando, FL
Print_ISBN :
978-1-4673-0773-4
DOI :
10.1109/INFCOM.2012.6195722