IDEAS home Printed from https://ideas.repec.org/a/spr/infosf/v16y2014i1d10.1007_s10796-013-9456-3.html
   My bibliography  Save this article

A self-similar super-peer overlay construction scheme for super large-scale P2P applications

Author

Listed:
  • Hung-Yi Teng

    (National Chung Cheng University)

  • Chien-Nan Lin

    (National Chung Cheng University)

  • Ren-Hung Hwang

    (National Chung Cheng University)

Abstract

Unstructured peer-to-peer (P2P) overlay networks with two-layer hierarchy, comprising an upper layer of super-peers and an underlying layer of ordinary peers, are used to improve the performance of large-scale P2P applications like content distribution and storage. In order to deal with continuous growth of participating peers, a scalable and efficient super-peer overlay topology is essential. However, there is relatively little research conducted on constructing such super-peer overlay topology. In the existed solutions, the number of connections required to be maintained by a super-peer is in direct proportion to the total number of super-peers. For super large-scale P2P applications, i.e. the number of participating peer is over 1,000,000, these solutions are not scalable and impractical. Therefore, in this paper, we propose a scalable hierarchical unstructured P2P system in which a self-similar square network graph (SSNG) is proposed to construct and maintain the super-peer overlay topology adaptively. The SSNG topology is a constant-degree topology in which each node maintains a constant number of neighbor nodes. Moreover, a simple and efficient message forwarding algorithm is presented to ensure each super-peer to receive just one flooding message. The analytical results showed that the proposed SSNG-based overlay is more scalable and efficient than the perfect difference graph (PDG)-based overlay proposed in the literature.

Suggested Citation

  • Hung-Yi Teng & Chien-Nan Lin & Ren-Hung Hwang, 2014. "A self-similar super-peer overlay construction scheme for super large-scale P2P applications," Information Systems Frontiers, Springer, vol. 16(1), pages 45-58, March.
    • Handle: RePEc:spr:infosf:v:16:y:2014:i:1:d:10.1007_s10796-013-9456-3
    DOI: 10.1007/s10796-013-9456-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10796-013-9456-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10796-013-9456-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mohammed Hawa & Raed Al-Zubi & Khalid A. Darabkh & Ghazi Al-Sukkar, 0. "Adaptive approach to restraining content pollution in peer-to-peer networks," Information Systems Frontiers, Springer, vol. 0, pages 1-18.
    2. Mohammed Hawa & Raed Al-Zubi & Khalid A. Darabkh & Ghazi Al-Sukkar, 2017. "Adaptive approach to restraining content pollution in peer-to-peer networks," Information Systems Frontiers, Springer, vol. 19(6), pages 1373-1390, December.
    3. Jun Li & Cuilian Li & Zhaoxi Fang & Haoyun Wang & Yaohui Wu, 2016. "Optimal layer division for low latency in DHT‐based hierarchical P2P network," International Journal of Network Management, John Wiley & Sons, vol. 26(2), pages 95-110, March.
    4. Ching-Hsien Hsu & Jianhua Ma & Mohammad S. Obaidat, 2014. "Dynamic intelligence towards merging cloud and communication services," Information Systems Frontiers, Springer, vol. 16(1), pages 1-5, March.

    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:infosf:v:16:y:2014:i:1:d:10.1007_s10796-013-9456-3. 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.