IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-27912-9_69.html
   My bibliography  Save this book chapter

Group-based Peer-to-Peer Network Routing and Searching Rules

In: Current Trends in High Performance Computing and Its Applications

Author

Listed:
  • Weiguo Wu

    (Xi’an Jiaotong University, Department of Computer Science and Technology)

  • Wenhao Hu

    (Xi’an Jiaotong University, Department of Computer Science and Technology)

  • Yongxiang Huang

    (Xi’an Jiaotong University, Department of Computer Science and Technology)

  • Depei Qian

    (Xi’an Jiaotong University, Department of Computer Science and Technology)

Abstract

In the Peer-to-Peer file-sharing system, nodes at the edge of the network take part in the applications and share their resources. As the scale enlarged, search efficiency became the major problem. We researched on the organization and the search algorithm of the Peer-to-Peer file-sharing system to improve its efficiency. A group-based peer-to-peer network model is presented in this paper. In this model, peers with the same interest are organized into one group. All peers attempt to select the best neighbors by measuring other peers. Compared with Gnutella-like P2P systems, the group-based system can achieve high performance and reduce the loads of network as requests are transmitted in scope of the group instead of the whole system. Also we present the value-headed walk search algorithm and the measurement of downloading files among multiple answers. In value-headed walk, the peer forwards query to a subset of its neighbors based on the value of them. Results from theoretical analysis and simulations show that group-based P2P model and value-headed walk search algorithm could greatly reduce the amount of messages generated by searching files in P2P system.

Suggested Citation

  • Weiguo Wu & Wenhao Hu & Yongxiang Huang & Depei Qian, 2005. "Group-based Peer-to-Peer Network Routing and Searching Rules," Springer Books, in: Wu Zhang & Weiqin Tong & Zhangxin Chen & Roland Glowinski (ed.), Current Trends in High Performance Computing and Its Applications, pages 509-514, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-27912-9_69
    DOI: 10.1007/3-540-27912-1_69
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-540-27912-9_69. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.