IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v26y2016i2p95-110.html
   My bibliography  Save this article

Optimal layer division for low latency in DHT‐based hierarchical P2P network

Author

Listed:
  • Jun Li
  • Cuilian Li
  • Zhaoxi Fang
  • Haoyun Wang
  • Yaohui Wu

Abstract

Hierarchical architecture can significantly reduce the workload overheads and facilitate effective search in peer‐to‐peer (P2P) network by dividing the peers into two layers: a supernode layer and an ordinary node layer. System scalability is therefore improved, which is critical to the deployment of P2P applications, particularly for the P2P‐based Voice over Internet Protocol systems. However, the lack of appropriate size ratio of the supernode layer to the ordinary node layer makes the system search performance far from being optimal. To address the problem, the goal of this paper is to find the optimal layer ratio, such that lookup latency is minimized, subject to the capacity constraint of supernodes. With this particular objective, this paper first formulates a search delay model for the distributed hash table (DHT)‐based layered P2P architecture, taking account of two main sources of latency: DHT routing and queuing delay at the supernode. Then the optimal ratio between supernodes and ordinary nodes is found with the analytical model. Simulation and numerical results show that the obtained solution can improve the performance of a two‐layer P2P system in terms of lookup latency. Copyright © 2016 John Wiley & Sons, Ltd.

Suggested Citation

  • 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.
    • Handle: RePEc:wly:intnem:v:26:y:2016:i:2:p:95-110
    DOI: 10.1002/nem.1922
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.1922
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nem.1922?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
    ---><---

    References listed on IDEAS

    as
    1. 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.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    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. 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.

    More about this item

    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:wly:intnem:v:26:y:2016:i:2:p:95-110. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    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.