Hierarchical peer-to-peer systems

L. Garcés-Erice, E. W. Biersack, P. A. Felber, Keith Ross, 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 and a scalable hierarchical overlay management. We study a two-tier hierarchy using 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.

    Original languageEnglish (US)
    Pages (from-to)1230-1239
    Number of pages10
    JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume2790
    StatePublished - 2004

    Fingerprint

    Humulus
    Hierarchical Systems
    Peer-to-peer Systems
    Overlay networks
    Overlay Networks
    Overlay
    Peer-to-peer (P2P)
    Chord or secant line
    Table
    Subset

    ASJC Scopus subject areas

    • Biochemistry, Genetics and Molecular Biology(all)
    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

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

    In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2790, 2004, p. 1230-1239.

    Research output: Contribution to journalArticle

    Garcés-Erice, L. ; Biersack, E. W. ; Felber, P. A. ; Ross, Keith ; Urvoy-Keller, G. / Hierarchical peer-to-peer systems. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2004 ; Vol. 2790. pp. 1230-1239.
    @article{fd15e886f5ba4b4daf5cb05892bfee2c,
    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 and a scalable hierarchical overlay management. We study a two-tier hierarchy using 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.",
    author = "L. Garc{\'e}s-Erice and Biersack, {E. W.} and Felber, {P. A.} and Keith Ross and G. Urvoy-Keller",
    year = "2004",
    language = "English (US)",
    volume = "2790",
    pages = "1230--1239",
    journal = "Lecture Notes in Computer Science",
    issn = "0302-9743",
    publisher = "Springer Verlag",

    }

    TY - JOUR

    T1 - Hierarchical peer-to-peer systems

    AU - Garcés-Erice, L.

    AU - Biersack, E. W.

    AU - Felber, P. A.

    AU - Ross, Keith

    AU - Urvoy-Keller, G.

    PY - 2004

    Y1 - 2004

    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 and a scalable hierarchical overlay management. We study a two-tier hierarchy using 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.

    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 and a scalable hierarchical overlay management. We study a two-tier hierarchy using 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.

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

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

    M3 - Article

    VL - 2790

    SP - 1230

    EP - 1239

    JO - Lecture Notes in Computer Science

    JF - Lecture Notes in Computer Science

    SN - 0302-9743

    ER -