Please use this identifier to cite or link to this item:
|Title:||Collision avoidance in hierarchical peer-to-peer systems|
|Authors:||Teo, Y.M. |
|Source:||Teo, Y.M.,Mihailescu, M. (2008). Collision avoidance in hierarchical peer-to-peer systems. Proceedings - 7th International Conference on Networking, ICN 2008 : 336-341. ScholarBank@NUS Repository. https://doi.org/10.1109/ICN.2008.110|
|Abstract:||In a two-level Chord-based hierarchical peer-to-peer system, nodes from the first-level overlay network, called supernodes, act as gateways to peers organized in the second-level overlay. Collision occurs when peer-to-peer operations create more than one supernode with the same node identifier in the first-level overlay. Collisions are reported to enlarge first-level overlay by more than 12 times the ideal size and thus increase the lookup path length. Other consequences of collisions include lookup failures even though the lookup resources exist in the network and reduced scalability of the system. In contrast to collision detection and correction techniques, this paper proposes: (i) a collision-free approach for the join and leave operations, and (ii) a new stabilization scheme to recover from second-level overlay node failures. However, avoiding collision due to supernode failures is complex and remains a challenge. Simulation results show that collisions can be avoided and our algorithms improve the overall system performance. © 2008 IEEE.|
|Source Title:||Proceedings - 7th International Conference on Networking, ICN 2008|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 11, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.