Please use this identifier to cite or link to this item:
|Title:||Collision detection and resolution in hierarchical peer-to-peer systems||Authors:||March, V.
|Keywords:||Collision detection and resolution algorithm
Structured overlay network
|Issue Date:||2005||Citation:||March, V.,Teo, Y.M.,Lim, H.B.,Eriksson, P.,Ayani, R. (2005). Collision detection and resolution in hierarchical peer-to-peer systems. Proceedings - Conference on Local Computer Networks, LCN 2005 : 2-9. ScholarBank@NUS Repository. https://doi.org/10.1109/LCN.2005.39||Abstract:||Structured peer-to-peer systems can be organized hierarchically as two-level overlay networks. The top-level overlay consists of groups of nodes, where each group is identified by a group identifier. In each group, one or more nodes are designated as supernodes and act as gateways to the nodes at the second level. A collision occurs during join operations, when two or more groups with the same group identifier are created at the top-level overlay. Collisions increase the lookup path length and the stabilization overhead, and reduce the scalability of hierarchical peer-to-peer systems. We propose a new scheme to detect and resolve collisions, and we study the impact of the collision problem on the performance of peer-to-peer systems. Our simulation results show the effectiveness of our scheme in reducing collisions and maintaining the size of the top-level overlay close to the ideal size. © 2005 IEEE.||Source Title:||Proceedings - Conference on Local Computer Networks, LCN||URI:||http://scholarbank.nus.edu.sg/handle/10635/40362||ISBN:||0769524214||DOI:||10.1109/LCN.2005.39|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.