Effective message routing in unstructured peer-to-peer overlays

被引:0
|
作者
Ciglaric, M [1 ]
机构
[1] Univ Ljubljana, Fac Comp & Informat Sci, Comp Commun Lab, Ljubljana 1000, Slovenia
来源
IEE PROCEEDINGS-COMMUNICATIONS | 2005年 / 152卷 / 05期
关键词
D O I
10.1049/ip-com:20045221
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
There is a lack of efficiency in flooding-based unstructured peer-to-peer overlays, where loosely coupled nodes require high local autonomy. Two routing improvements are compared based on answer caching. where the cached metadata facilitates content-based routing of queries. Since peer nodes keep joining and leaving the overlay, a mechanism to keep the metadata valid is analysed. The problem area is reviewed, an overlay network model described, and related message routing issues and the simulation environment explained. Simulation results confirm expectations about the traffic reduction, while the user experience does not deteriorate.
引用
收藏
页码:673 / 678
页数:6
相关论文
共 50 条
  • [41] Large scaling unstructured peer-to-peer networks with heterogeneity-aware topology and routing
    Srivatsa, Mudhakar
    Gedik, Bugra
    Liu, Ling
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2006, 17 (11) : 1277 - 1293
  • [42] Towards a common API for structured peer-to-peer overlays
    Dabek, R
    Zhao, B
    Druschel, P
    Kubiatowicz, J
    Stoica, I
    [J]. PEER-TO-PEER SYSTEMS II, 2003, 2735 : 33 - 44
  • [43] A fair resource allocation algorithm for peer-to-peer overlays
    Drougas, Y
    Kalogeraki, V
    [J]. IEEE INFOCOM 2005: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-4, PROCEEDINGS, 2005, : 2853 - 2858
  • [44] Reinforcement learning for query-oriented routing indices in unstructured peer-to-peer networks
    Shi, Cong
    Meng, Shicong
    Liu, Yuanjie
    Han, Dingyi
    Yu, Yong
    [J]. SIXTH IEEE INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS, 2006, : 267 - +
  • [45] Replication strategies in unstructured peer-to-peer networks
    Cohen, E
    Shenker, S
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2002, 32 (04) : 177 - 190
  • [46] Quantitative evaluation of unstructured peer-to-peer architectures
    Benevenuto, F
    Ismael, J
    Almeida, J
    [J]. 2004 INTERNATIONAL WORKSHOP ON HOT TOPICS IN PEER-TO-PEER SYSTEMS, PROCEEDINGS, 2004, : 56 - 65
  • [47] ON COVERAGE BOUNDS OF UNSTRUCTURED PEER-TO-PEER NETWORKS
    Chandra, Joydeep
    Ganguly, Niloy
    [J]. ADVANCES IN COMPLEX SYSTEMS, 2011, 14 (04): : 611 - 633
  • [48] Efficient search in unstructured peer-to-peer networks
    Cholvi, V
    Felber, P
    Biersack, E
    [J]. EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 2004, 15 (06): : 535 - 548
  • [49] Survey on Anonymity in Unstructured Peer-to-Peer Systems
    Ren-Yi Xiao
    [J]. Journal of Computer Science and Technology, 2008, 23 : 660 - 671
  • [50] On Unbiased Sampling for Unstructured Peer-to-Peer Networks
    Stutzbach, Daniel
    Rejaie, Reza
    Duffield, Nick
    Sen, Subhabrata
    Willinger, Walter
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2009, 17 (02) : 377 - 390