Hierarchical peer-to-peer systems

L. Garcés-Erice, E. W. Biersack, Keith Ross, P. A. Felber, G. Urvoy-Keller

    Research output: Contribution to journalArticle

    Abstract

    Structured peer-to-peer (P2P) lookup services organize peers into a flat overlay network and offer distributed hash table (DHT) functionality. Data is associated with keys and each peer is responsible for a subset of the keys. In hierarchical DHTs, peers are organized into groups, and each group has its autonomous intra-group overlay network and lookup service. Groups are organized in a top-level overlay network. To find a peer that is responsible for a key, the top-level overlay first determines the group responsible for the key; the responsible group then uses its intra-group overlay to determine the specific peer that is responsible for the key. We provide a general framework for hierarchical DHTs with scalable overlay management. We specifically study a two-tier hierarchy that uses Chord for the top level. Our analysis shows that by using the most reliable peers in the top level, the hierarchical design significantly reduces the expected number of hops. We also present a method to construct hierarchical DHTs that map well to the Internet topology and achieve short intra-group communication delay. The results demonstrate the feasibility of locality-based peer groups, which allow P2P systems to take full advantage of the hierarchical design.

    Original languageEnglish (US)
    Pages (from-to)643-657
    Number of pages15
    JournalParallel Processing Letters
    Volume13
    Issue number4
    DOIs
    StatePublished - Dec 2003

    Fingerprint

    Hierarchical Systems
    Peer-to-peer Systems
    Overlay networks
    Overlay Networks
    Overlay
    Topology
    Internet
    Communication
    Group Delay
    Group Communication
    Communication Delay
    P2P Systems
    Peer-to-peer (P2P)
    Chord or secant line
    Locality
    Table
    Subset

    Keywords

    • Distributed hash tables
    • Hierarchical routing
    • Peer-to-peer
    • Topology awareness

    ASJC Scopus subject areas

    • Computer Science(all)

    Cite this

    Garcés-Erice, L., Biersack, E. W., Ross, K., Felber, P. A., & Urvoy-Keller, G. (2003). Hierarchical peer-to-peer systems. Parallel Processing Letters, 13(4), 643-657. https://doi.org/10.1142/S0129626403001574

    Hierarchical peer-to-peer systems. / Garcés-Erice, L.; Biersack, E. W.; Ross, Keith; Felber, P. A.; Urvoy-Keller, G.

    In: Parallel Processing Letters, Vol. 13, No. 4, 12.2003, p. 643-657.

    Research output: Contribution to journalArticle

    Garcés-Erice, L, Biersack, EW, Ross, K, Felber, PA & Urvoy-Keller, G 2003, 'Hierarchical peer-to-peer systems', Parallel Processing Letters, vol. 13, no. 4, pp. 643-657. https://doi.org/10.1142/S0129626403001574
    Garcés-Erice L, Biersack EW, Ross K, Felber PA, Urvoy-Keller G. Hierarchical peer-to-peer systems. Parallel Processing Letters. 2003 Dec;13(4):643-657. https://doi.org/10.1142/S0129626403001574
    Garcés-Erice, L. ; Biersack, E. W. ; Ross, Keith ; Felber, P. A. ; Urvoy-Keller, G. / Hierarchical peer-to-peer systems. In: Parallel Processing Letters. 2003 ; Vol. 13, No. 4. pp. 643-657.
    @article{4e9f8b1c5fa34b429436f7f5f11ae0ce,
    title = "Hierarchical peer-to-peer systems",
    abstract = "Structured peer-to-peer (P2P) lookup services organize peers into a flat overlay network and offer distributed hash table (DHT) functionality. Data is associated with keys and each peer is responsible for a subset of the keys. In hierarchical DHTs, peers are organized into groups, and each group has its autonomous intra-group overlay network and lookup service. Groups are organized in a top-level overlay network. To find a peer that is responsible for a key, the top-level overlay first determines the group responsible for the key; the responsible group then uses its intra-group overlay to determine the specific peer that is responsible for the key. We provide a general framework for hierarchical DHTs with scalable overlay management. We specifically study a two-tier hierarchy that uses Chord for the top level. Our analysis shows that by using the most reliable peers in the top level, the hierarchical design significantly reduces the expected number of hops. We also present a method to construct hierarchical DHTs that map well to the Internet topology and achieve short intra-group communication delay. The results demonstrate the feasibility of locality-based peer groups, which allow P2P systems to take full advantage of the hierarchical design.",
    keywords = "Distributed hash tables, Hierarchical routing, Peer-to-peer, Topology awareness",
    author = "L. Garc{\'e}s-Erice and Biersack, {E. W.} and Keith Ross and Felber, {P. A.} and G. Urvoy-Keller",
    year = "2003",
    month = "12",
    doi = "10.1142/S0129626403001574",
    language = "English (US)",
    volume = "13",
    pages = "643--657",
    journal = "Parallel Processing Letters",
    issn = "0129-6264",
    publisher = "World Scientific Publishing Co. Pte Ltd",
    number = "4",

    }

    TY - JOUR

    T1 - Hierarchical peer-to-peer systems

    AU - Garcés-Erice, L.

    AU - Biersack, E. W.

    AU - Ross, Keith

    AU - Felber, P. A.

    AU - Urvoy-Keller, G.

    PY - 2003/12

    Y1 - 2003/12

    N2 - Structured peer-to-peer (P2P) lookup services organize peers into a flat overlay network and offer distributed hash table (DHT) functionality. Data is associated with keys and each peer is responsible for a subset of the keys. In hierarchical DHTs, peers are organized into groups, and each group has its autonomous intra-group overlay network and lookup service. Groups are organized in a top-level overlay network. To find a peer that is responsible for a key, the top-level overlay first determines the group responsible for the key; the responsible group then uses its intra-group overlay to determine the specific peer that is responsible for the key. We provide a general framework for hierarchical DHTs with scalable overlay management. We specifically study a two-tier hierarchy that uses Chord for the top level. Our analysis shows that by using the most reliable peers in the top level, the hierarchical design significantly reduces the expected number of hops. We also present a method to construct hierarchical DHTs that map well to the Internet topology and achieve short intra-group communication delay. The results demonstrate the feasibility of locality-based peer groups, which allow P2P systems to take full advantage of the hierarchical design.

    AB - Structured peer-to-peer (P2P) lookup services organize peers into a flat overlay network and offer distributed hash table (DHT) functionality. Data is associated with keys and each peer is responsible for a subset of the keys. In hierarchical DHTs, peers are organized into groups, and each group has its autonomous intra-group overlay network and lookup service. Groups are organized in a top-level overlay network. To find a peer that is responsible for a key, the top-level overlay first determines the group responsible for the key; the responsible group then uses its intra-group overlay to determine the specific peer that is responsible for the key. We provide a general framework for hierarchical DHTs with scalable overlay management. We specifically study a two-tier hierarchy that uses Chord for the top level. Our analysis shows that by using the most reliable peers in the top level, the hierarchical design significantly reduces the expected number of hops. We also present a method to construct hierarchical DHTs that map well to the Internet topology and achieve short intra-group communication delay. The results demonstrate the feasibility of locality-based peer groups, which allow P2P systems to take full advantage of the hierarchical design.

    KW - Distributed hash tables

    KW - Hierarchical routing

    KW - Peer-to-peer

    KW - Topology awareness

    UR - http://www.scopus.com/inward/record.url?scp=10744230331&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=10744230331&partnerID=8YFLogxK

    U2 - 10.1142/S0129626403001574

    DO - 10.1142/S0129626403001574

    M3 - Article

    AN - SCOPUS:10744230331

    VL - 13

    SP - 643

    EP - 657

    JO - Parallel Processing Letters

    JF - Parallel Processing Letters

    SN - 0129-6264

    IS - 4

    ER -