Exploiting heterogeneity of nodes to enhance search performance in large-scale peer-to-peer network

被引:0
作者
Gong, Yadong [1 ]
Lin, Xiaola [1 ]
机构
[1] Sun Yat Sen Univ, Dept Comp Sci, Guangzhou 510275, Guangdong, Peoples R China
来源
SNPD 2007: EIGHTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, VOL 3, PROCEEDINGS | 2007年
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A large number of resource locating algorithms have been proposed in peer-to-peer (P2P) networks. However, the query efficiency of most existing methods is limited to large-scale P2P networks. In this paper, we propose a new decentralized P2P architecture, by taking advantage of the heterogeneous characters of nodes to integrate the resources of stable nodes, and simplify the management of dynamic nodes based on two different types of clustering. In our proposed architecture, group-based semantic overlay network is formed by node clustering and resources of stable nodes are organized by a set of cooperative resource clustering frameworks. When a query is generated, it will be first processed in local group, and if it fails to hit the targets, it will be relayed to the resource clustering frameworks. Simulation shows that this architecture can greatly reduce the search traffic in large-scale P2P networks.
引用
收藏
页码:847 / +
页数:2
相关论文
共 15 条
  • [1] Adar E, FREE RIDING GNUTELLA
  • [2] [Anonymous], P IEEE INFOCOM
  • [3] Gkantsidis C., 2004, P IEEE INFOCOM
  • [4] GUMMADI K, 2003, P 19 ACM S OP SYST P
  • [5] HASSAN J, 2004, P IEEE
  • [6] JAMES W, 2005, P 2005 ACM SIGMETRIC
  • [7] LI XQ, 2005, P 25 IEEE INT C DIST
  • [8] LIN KI, 2001, P 7 INT C DAT SYST A
  • [9] LV Q, 2002, P 16 ACM INT C SUP
  • [10] ROWSTRON A, 2001, P IFIP ACM MIDDLEWAR