Welcome to the InfoSci Platform
Hierarchical Structured Peer-to-Peer Networks

Hierarchical Structured Peer-to-Peer Networks

Yong Meng Teo, Verdi March, Marian Mihailescu
Copyright: © 2010 |Pages: 23
ISBN13: 9781605666617|ISBN10: 1605666610|EISBN13: 9781605666624
DOI: 10.4018/978-1-60566-661-7.ch007
Cite Chapter Cite Chapter

MLA

Teo, Yong Meng, et al. "Hierarchical Structured Peer-to-Peer Networks." Handbook of Research on Scalable Computing Technologies, edited by Kuan-Ching Li, et al., IGI Global, 2010, pp. 140-162. https://doi.org/10.4018/978-1-60566-661-7.ch007

APA

Teo, Y. M., March, V., & Mihailescu, M. (2010). Hierarchical Structured Peer-to-Peer Networks. In K. Li, C. Hsu, L. Yang, J. Dongarra, & H. Zima (Eds.), Handbook of Research on Scalable Computing Technologies (pp. 140-162). IGI Global. https://doi.org/10.4018/978-1-60566-661-7.ch007

Chicago

Teo, Yong Meng, Verdi March, and Marian Mihailescu. "Hierarchical Structured Peer-to-Peer Networks." In Handbook of Research on Scalable Computing Technologies, edited by Kuan-Ching Li, et al., 140-162. Hershey, PA: IGI Global, 2010. https://doi.org/10.4018/978-1-60566-661-7.ch007

Export Reference

Mendeley
Favorite

Abstract

Structured peer-to-peer networks are scalable overlay network infrastructures that support Internet-scale network applications. A globally consistent peer-to-peer protocol maintains the structural properties of the network with peers dynamically joining, leaving and failing in the network. In this chapter, the authors discuss hierarchical distributed hash tables (DHT) as an approach to reduce the overhead of maintaining the overlay network. In a two-level hierarchical DHT, the top-level overlay consists of groups of nodes where each group is distinguished by a unique group identifier. In each group, one or more nodes are designated as supernodes and act as gateways to nodes at the second level. Collisions of groups occur when concurrent node joins result in the creation of multiple groups with the same group identifier. This has the adverse effects of increasing the lookup path length due to a larger top-level overlay, and the overhead of overlay network maintenance. We discuss two main approaches to address the group collision problem: collision detection-and-resolution, and collision avoidance. As an example, they describe an implementation of hierarchical DHT by extending Chord as the underlying overlay graph.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.