Please use this identifier to cite or link to this item:
|Title:||Hierarchical structured peer-to-peer networks||Authors:||Teo, Y.M.
|Issue Date:||2009||Citation:||Teo, Y.M.,March, V.,Mihailescu, M. (2009). Hierarchical structured peer-to-peer networks. The Handbook of Research on Scalable Computing Technologies 1 : 140-162. ScholarBank@NUS Repository. https://doi.org/10.4018/978-1-60566-661-7.ch007||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. © 2010, IGI Global.||Source Title:||The Handbook of Research on Scalable Computing Technologies||URI:||http://scholarbank.nus.edu.sg/handle/10635/78458||ISBN:||9781605666617||DOI:||10.4018/978-1-60566-661-7.ch007|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 6, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.