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 条
  • [1] QuickFlood: An Efficient Search Algorithm for Unstructured Peer-to-Peer Networks
    Badjini, Hassan
    Othman, Mohamed
    Ibrahim, Hamidah
    NETWORKED DIGITAL TECHNOLOGIES, 2011, 136 : 82 - 92
  • [2] AN EFFICIENT GOSSIP BASED OVERLAY NETWORK FOR PEER-TO-PEER NETWORKS
    Islam, Muhammad Hasan
    Waheed, Sanaa
    Zubair, Izza
    2009 FIRST INTERNATIONAL CONFERENCE ON UBIQUITOUS AND FUTURE NETWORKS, 2009, : 62 - +
  • [3] Efficient search in unstructured peer-to-peer networks
    Cholvi, V
    Felber, P
    Biersack, E
    EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 2004, 15 (06): : 535 - 548
  • [4] Gossip-based search selection in hybrid peer-to-peer networks
    Zaharia, A.
    Keshav, S.
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2008, 20 (02): : 139 - 153
  • [5] Efficient immunization algorithm for peer-to-peer networks
    Chen, H
    Jin, H
    Sun, JH
    Han, ZF
    HIGH PERFORMANCE COMPUTING - HIPC 2004, 2004, 3296 : 232 - 241
  • [6] Efficient immunization algorithm for peer-to-peer networks
    Chen, H
    Jin, H
    Sun, JH
    Han, ZF
    COMPUTATIONAL SCIENCE - ICCS 2004, PT 1, PROCEEDINGS, 2004, 3036 : 623 - 626
  • [7] Asynchronous Gossip in Smartphone Peer-to-Peer Networks
    Newport, Calvin
    Weaver, Alex
    Zheng, Chaodong
    17TH ANNUAL INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING IN SENSOR SYSTEMS (DCOSS 2021), 2021, : 148 - 155
  • [8] PathFinder: Efficient Lookups and Efficient Search in Peer-to-Peer Networks
    Bradler, Dirk
    Krumov, Lachezar
    Muhlhauser, Max
    Kangasharju, Jussi
    DISTRIBUTED COMPUTING AND NETWORKING, 2011, 6522 : 77 - +
  • [9] Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
    Lin, Tsungnan
    Lin, Pochiang
    Wang, Hsinping
    Chen, Chiahung
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2009, 20 (05) : 654 - 666
  • [10] A keyword search algorithm for structured peer-to-peer networks
    Szekeres, Adriana
    Baranga, Silviu Horia
    Dobre, Ciprian
    Cristea, Valentin
    INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING, 2011, 2 (03) : 204 - 214