Optimizing peer relationships in a super-peer network

P. Garbacki, D.H.J. Epema, M. Steen, van

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    24 Citations (Scopus)
    65 Downloads (Pure)

    Abstract

    Super-peer architectures exploit the heterogeneity of nodes in a P2P network by assigning additional responsibilities to higher-capacity nodes. In the design of a super-peer network for file sharing, several issues have to be addressed: how client peers are related to super-peers, how super-peers locate files, how the load is balanced among the super-peers, and how the system deals with node failures. In this paper we introduce a self-organizing super-peer network architecture (SOSPNET) that solves these issues in a fully decentralized manner. SOSPNET maintains a super-peer network topology that reflects the semantic similarity of peers sharing content interests. Super-peers maintain semantic caches of pointers to files which are requested by peers with similar interests. Client peers, on the other hand, dynamically select super-peers offering the best search performance. We show how this simple approach can be employed not only to optimize searching, but also to solve generally difficult problems encountered in P2P architectures such as load balancing and fault tolerance. We evaluate SOSPNET using a model of the semantic structure derived from the 8-month traces of two large file-sharing communities. The obtained results indicate that SOSPNET achieves close-to-optimal file search performance, quickly adjusts to changes in the environment (node joins and leaves), survives even catastrophic node failures, and efficiently distributes the system load taking into account peer capacities.
    Original languageEnglish
    Title of host publicationProceedings of the 27th International Conference on Distributed Computing Systems (ICDCS'07, Toronto ON, Canada, June 25-27, 2007)
    PublisherInstitute of Electrical and Electronics Engineers
    Pages1-10
    ISBN (Print)0-7695-2837-3
    DOIs
    Publication statusPublished - 2007

    Fingerprint

    Network architecture
    Semantics
    Fault tolerance
    Resource allocation
    Topology

    Cite this

    Garbacki, P., Epema, D. H. J., & Steen, van, M. (2007). Optimizing peer relationships in a super-peer network. In Proceedings of the 27th International Conference on Distributed Computing Systems (ICDCS'07, Toronto ON, Canada, June 25-27, 2007) (pp. 1-10). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ICDCS.2007.126
    Garbacki, P. ; Epema, D.H.J. ; Steen, van, M. / Optimizing peer relationships in a super-peer network. Proceedings of the 27th International Conference on Distributed Computing Systems (ICDCS'07, Toronto ON, Canada, June 25-27, 2007). Institute of Electrical and Electronics Engineers, 2007. pp. 1-10
    @inproceedings{abb8a94c559e4a1682b6cf7488b16a89,
    title = "Optimizing peer relationships in a super-peer network",
    abstract = "Super-peer architectures exploit the heterogeneity of nodes in a P2P network by assigning additional responsibilities to higher-capacity nodes. In the design of a super-peer network for file sharing, several issues have to be addressed: how client peers are related to super-peers, how super-peers locate files, how the load is balanced among the super-peers, and how the system deals with node failures. In this paper we introduce a self-organizing super-peer network architecture (SOSPNET) that solves these issues in a fully decentralized manner. SOSPNET maintains a super-peer network topology that reflects the semantic similarity of peers sharing content interests. Super-peers maintain semantic caches of pointers to files which are requested by peers with similar interests. Client peers, on the other hand, dynamically select super-peers offering the best search performance. We show how this simple approach can be employed not only to optimize searching, but also to solve generally difficult problems encountered in P2P architectures such as load balancing and fault tolerance. We evaluate SOSPNET using a model of the semantic structure derived from the 8-month traces of two large file-sharing communities. The obtained results indicate that SOSPNET achieves close-to-optimal file search performance, quickly adjusts to changes in the environment (node joins and leaves), survives even catastrophic node failures, and efficiently distributes the system load taking into account peer capacities.",
    author = "P. Garbacki and D.H.J. Epema and {Steen, van}, M.",
    year = "2007",
    doi = "10.1109/ICDCS.2007.126",
    language = "English",
    isbn = "0-7695-2837-3",
    pages = "1--10",
    booktitle = "Proceedings of the 27th International Conference on Distributed Computing Systems (ICDCS'07, Toronto ON, Canada, June 25-27, 2007)",
    publisher = "Institute of Electrical and Electronics Engineers",
    address = "United States",

    }

    Garbacki, P, Epema, DHJ & Steen, van, M 2007, Optimizing peer relationships in a super-peer network. in Proceedings of the 27th International Conference on Distributed Computing Systems (ICDCS'07, Toronto ON, Canada, June 25-27, 2007). Institute of Electrical and Electronics Engineers, pp. 1-10. https://doi.org/10.1109/ICDCS.2007.126

    Optimizing peer relationships in a super-peer network. / Garbacki, P.; Epema, D.H.J.; Steen, van, M.

    Proceedings of the 27th International Conference on Distributed Computing Systems (ICDCS'07, Toronto ON, Canada, June 25-27, 2007). Institute of Electrical and Electronics Engineers, 2007. p. 1-10.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    TY - GEN

    T1 - Optimizing peer relationships in a super-peer network

    AU - Garbacki, P.

    AU - Epema, D.H.J.

    AU - Steen, van, M.

    PY - 2007

    Y1 - 2007

    N2 - Super-peer architectures exploit the heterogeneity of nodes in a P2P network by assigning additional responsibilities to higher-capacity nodes. In the design of a super-peer network for file sharing, several issues have to be addressed: how client peers are related to super-peers, how super-peers locate files, how the load is balanced among the super-peers, and how the system deals with node failures. In this paper we introduce a self-organizing super-peer network architecture (SOSPNET) that solves these issues in a fully decentralized manner. SOSPNET maintains a super-peer network topology that reflects the semantic similarity of peers sharing content interests. Super-peers maintain semantic caches of pointers to files which are requested by peers with similar interests. Client peers, on the other hand, dynamically select super-peers offering the best search performance. We show how this simple approach can be employed not only to optimize searching, but also to solve generally difficult problems encountered in P2P architectures such as load balancing and fault tolerance. We evaluate SOSPNET using a model of the semantic structure derived from the 8-month traces of two large file-sharing communities. The obtained results indicate that SOSPNET achieves close-to-optimal file search performance, quickly adjusts to changes in the environment (node joins and leaves), survives even catastrophic node failures, and efficiently distributes the system load taking into account peer capacities.

    AB - Super-peer architectures exploit the heterogeneity of nodes in a P2P network by assigning additional responsibilities to higher-capacity nodes. In the design of a super-peer network for file sharing, several issues have to be addressed: how client peers are related to super-peers, how super-peers locate files, how the load is balanced among the super-peers, and how the system deals with node failures. In this paper we introduce a self-organizing super-peer network architecture (SOSPNET) that solves these issues in a fully decentralized manner. SOSPNET maintains a super-peer network topology that reflects the semantic similarity of peers sharing content interests. Super-peers maintain semantic caches of pointers to files which are requested by peers with similar interests. Client peers, on the other hand, dynamically select super-peers offering the best search performance. We show how this simple approach can be employed not only to optimize searching, but also to solve generally difficult problems encountered in P2P architectures such as load balancing and fault tolerance. We evaluate SOSPNET using a model of the semantic structure derived from the 8-month traces of two large file-sharing communities. The obtained results indicate that SOSPNET achieves close-to-optimal file search performance, quickly adjusts to changes in the environment (node joins and leaves), survives even catastrophic node failures, and efficiently distributes the system load taking into account peer capacities.

    U2 - 10.1109/ICDCS.2007.126

    DO - 10.1109/ICDCS.2007.126

    M3 - Conference contribution

    SN - 0-7695-2837-3

    SP - 1

    EP - 10

    BT - Proceedings of the 27th International Conference on Distributed Computing Systems (ICDCS'07, Toronto ON, Canada, June 25-27, 2007)

    PB - Institute of Electrical and Electronics Engineers

    ER -

    Garbacki P, Epema DHJ, Steen, van M. Optimizing peer relationships in a super-peer network. In Proceedings of the 27th International Conference on Distributed Computing Systems (ICDCS'07, Toronto ON, Canada, June 25-27, 2007). Institute of Electrical and Electronics Engineers. 2007. p. 1-10 https://doi.org/10.1109/ICDCS.2007.126