TY - GEN
T1 - SocP2P
T2 - 17th IEEE Symposium on Computers and Communication, ISCC 2012
AU - Farahbakhsh, Reza
AU - Crespi, Noel
AU - Cuevas, Angel
AU - Adhikari, Sraddha
AU - Mani, Mehdi
AU - Sanguankotchakorn, Teerapat
PY - 2012/9/28
Y1 - 2012/9/28
N2 - Content management appears as an essential requirement in order to deploy enhanced P2P networks. In P2P networks, the content that is requested by the query node could be located at different locations/nodes; therefore an efficient search mechanism is required. The proposed search algorithm in this paper, called socP2P, relies on peers' social relationships (friendships, shared interests, shared background and experiences) to improve the content discovery compared to similar solutions. With socP2P nodes can improve searches by using knowledge gained by overheard information during their stay in the network. In addition, our algorithm exploits peers' common interests, friendships, and capability of memorizing experiences (received and routed queries) by them. Simulation results show that socP2P is able to achieve a high success rate, low delay and low overhead. We have verified that our algorithm is not only useful in finding popular contents in the network but also good enough to locate rare files. The obtained results reflect that exploiting social information in P2P networks leads to a more efficient content search mechanism.
AB - Content management appears as an essential requirement in order to deploy enhanced P2P networks. In P2P networks, the content that is requested by the query node could be located at different locations/nodes; therefore an efficient search mechanism is required. The proposed search algorithm in this paper, called socP2P, relies on peers' social relationships (friendships, shared interests, shared background and experiences) to improve the content discovery compared to similar solutions. With socP2P nodes can improve searches by using knowledge gained by overheard information during their stay in the network. In addition, our algorithm exploits peers' common interests, friendships, and capability of memorizing experiences (received and routed queries) by them. Simulation results show that socP2P is able to achieve a high success rate, low delay and low overhead. We have verified that our algorithm is not only useful in finding popular contents in the network but also good enough to locate rare files. The obtained results reflect that exploiting social information in P2P networks leads to a more efficient content search mechanism.
KW - Content Discovery
KW - Peer-to-Peer networks
KW - Random Walk
KW - Social Network
U2 - 10.1109/ISCC.2012.6249350
DO - 10.1109/ISCC.2012.6249350
M3 - Conference contribution
AN - SCOPUS:84866635083
SN - 9781467327121
T3 - Proceedings - IEEE Symposium on Computers and Communications
SP - 530
EP - 533
BT - 2012 IEEE Symposium on Computers and Communications, ISCC 2012
Y2 - 1 July 2012 through 4 July 2012
ER -