A Multidimensional Heuristic for Social Routing in Peer-to-Peer Networks

被引：0
|
作者：
Jia, Shuo [1 ]
St Juste, Pierre [1 ]
Figueiredo, Renato J. [1 ]
机构：
[1] Univ Florida, Adv Comp & Informat Syst Lab, Gainesville, FL 32611 USA
来源：
2013 IEEE CONSUMER COMMUNICATIONS AND NETWORKING CONFERENCE (CCNC) | 2013年
关键词：
social routing; peer-to-peer network; decentralized search; social network; small-world property; decentralized social application;
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
A fundamental problem encountered in designing decentralized social applications is the issue of efficiently locating target nodes in social peer-to-peer networks based on local information only. The unique "small-world" phenomenon of social networks shows that a typical pair of nodes is connected by very short chains of intermediate friends, and individuals are able to collectively discover such short paths. In this paper, we propose a decentralized algorithm that exploits this " small-world" phenomenon to discover efficient routes to reach target nodes in unstructured social overlays. In order to test the performance of this algorithm, we simulate it on a real-world social graph dataset crawled from a large online social networking website (LiveJournal). Compared with other related works, the simulation results show that our proposed decentralized social routing algorithm not only shortens the median length of the search path, but also increases the success rate of finding such routes between arbitrary pair of nodes in the LiveJournal social graph.
引用
收藏
页码：329 / 335
页数：7
相关论文
共 50 条
  • [21] An aware ant routing algorithm in mobile peer-to-peer networks
    School of Information, Liaoning University, Shenyang 110036, China
    不详
    Jisuanji Xuebao, 7 (1456-1464):
  • [22] Peer-to-Peer Networks
    Lin Yu1
    2. Peking University
    ZTECommunications, 2006, (01) : 53 - 57
  • [23] Peer-to-peer networks
    Fox, G
    COMPUTING IN SCIENCE & ENGINEERING, 2001, 3 (03) : 75 - 77
  • [24] How Community-Based Peer-to-Peer Social Networks Can Affect Query Routing?
    Modarresi, Amir
    Mamat, Ali
    Ibrahim, Hamidah
    Mustapha, Norwati
    NCM 2008 : 4TH INTERNATIONAL CONFERENCE ON NETWORKED COMPUTING AND ADVANCED INFORMATION MANAGEMENT, VOL 1, PROCEEDINGS, 2008, : 432 - 437
  • [25] Self-organizing peer-to-peer social networks
    Wang, Fang
    Sun, Yaoru
    COMPUTATIONAL INTELLIGENCE, 2008, 24 (03) : 213 - 233
  • [26] LibreSocial: A peer-to-peer framework for online social networks
    Graffi, Kalman
    Masinde, Newton
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2021, 33 (08):
  • [27] Introducing social aspects to search in peer-to-peer networks
    Schenk, S
    PROFESSIONAL KNOWLEDGE MANAGEMENT, 2005, 3782 : 234 - 242
  • [28] Adaptive peer-to-peer routing with proximity
    Liau, CY
    Hidayanto, AN
    Bressan, S
    DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2003, 2736 : 454 - 463
  • [29] Adaptive peer-to-peer routing with proximity
    Liau, Chu Yee
    Hidayanto, Achmad Nizar
    Bressan, Stephane
    2003, Springer Verlag (2736):
  • [30] Routing indices for peer-to-peer systems
    Crespo, A
    Garcia-Molina, H
    22ND INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2002, : 23 - 32
12345