Multilayer light-gossip - An efficient search algorithm in peer-to-peer networks

被引:0
|
作者
College of Computer and Communication, Hunan University, Changsha 410082, China [1 ]
不详 [2 ]
不详 [3 ]
机构
来源
Jisuanji Yanjiu yu Fazhan | 2006年 / 6卷 / 1008-1018期
关键词
Algorithms - Data communication systems - Performance - Routers - Topology;
D O I
10.1360/crad20060608
中图分类号
学科分类号
摘要
In existing unstructured P2P systems, the application layer protocol simply uses flooding algorithm to route peer's querying and the lack of cache scheme, which is just implemented on application layer and doesn't use down-layer's information routing of Internet. So it has poor scalability and low efficiency. In the RLP2P network based on the architecture of layer-region, the routing space is divided into two layers, the on region layer and the in region layer, advantages of both the flooding distributed forward search and spanning tree algorithm are combined, and a new efficient search algorithm of multilayer light-gossip and routing strategy of beehive based on regular hexagon in region is proposed. First, it classifies the message of the network into diffusions based on region and in region, keeps the robust and validity searched for the networks with certain redundant messages, and makes the workload of locating service and all the network host-count of range query bring down to regions. Second, it adopts the forecast evaluation means realize to route messages that are divided into groups in advance, enable the route messages to forward automatically along a shortest path on time measurement. The simulations results show that multilayer light-gossip algorithm improves search efficiently greatly and lowers redundant messages so that it enables the whole comprehensive performance of the networks maintain a fine state and scalability under the environment of wide area.
引用
收藏
相关论文
共 50 条
  • [31] Gossip in a Smartphone Peer-to-Peer Network
    Newport, Calvin
    PROCEEDINGS OF THE ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'17), 2017, : 43 - 52
  • [32] Efficient semantic search in peer-to-peer systems
    Zhou, AY
    Ling, B
    Lu, ZG
    Ng, WS
    Shu, YF
    Tan, KL
    ADVANCES IN WEB-AGE INFORMATION MANAGEMENT, PROCEEDINGS, 2003, 2762 : 278 - 289
  • [33] LAAPS: an efficient file-based search in unstructured peer-to-peer networks using reinforcement algorithm
    Shamshirband S.
    Soleimani H.
    Shamshirband, Shahaboddin (shahaboddin.shamshirband@tdt.edu.vn), 1600, Taylor and Francis Ltd. (43): : 62 - 69
  • [34] Fast similarity search in peer-to-peer networks
    Bocek, Thomas
    Hunt, Ela
    Hausheer, David
    Stiller, Burkhard
    2008 IEEE NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM, VOLS 1 AND 2, 2008, : 240 - +
  • [35] Wildcard search in structured peer-to-peer networks
    Joung, Yuh-Jzer
    Yang, Li-Wei
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2007, 19 (11) : 1524 - 1540
  • [36] Differentiated search in hierarchical peer-to-peer networks
    Wang, C
    Xiao, L
    Zheng, P
    2005 International Conference on Parallel Processsing, Proceedings, 2005, : 269 - 276
  • [37] Hierarchical multidimensional search in peer-to-peer networks
    Tran, D. A.
    Nguyen, T.
    COMPUTER COMMUNICATIONS, 2008, 31 (02) : 346 - 357
  • [38] Extending Peer-to-Peer Networks for Approximate Search
    Mowat, Alain
    Schmidt, Roman
    Schumacher, Michael
    Constantinescu, Ion
    APPLIED COMPUTING 2008, VOLS 1-3, 2008, : 455 - +
  • [39] Search performance analysis in peer-to-peer networks
    Lin, TN
    Wang, HP
    THIRD INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING (P2P2003), PROCEEDINGS, 2003, : 204 - 205
  • [40] Adaptive Probabilistic Search for Peer-to-Peer networks
    Tsoumakos, D
    Roussopoulos, N
    THIRD INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING (P2P2003), PROCEEDINGS, 2003, : 102 - 109