Please use this identifier to cite or link to this item:
|Title:||ID repetition in structured P2P networks|
|Citation:||Yu, J., Li, Z., Xiao, P., Fang, C., Xu, J., Chang, E.-C. (2011). ID repetition in structured P2P networks. Computer Journal 54 (6) : 962-975. ScholarBank@NUS Repository. https://doi.org/10.1093/comjnl/bxr017|
|Abstract:||Identity (ID) uniqueness is essential in distributed hash table (DHT)-based systems, as peer lookup and resource searching rely on ID matching. However, many DHT implementations in the wild, such as Kad and Mainline, do not enforce such uniqueness. Most previous works and measurements on DHTs do not take into account that IDs among peers may not be unique. Unfortunately, we observe that a significant portion of peers, i.e. 19.5 of the peers in Kad and 4.0 of the peers in Mainline, do not have unique IDs. These repetitions would mislead the measurements and modeling on those networks. We further focus on investigating the repetition in Kad considering its wider usage and more serious situation of repetition. We observe that there are a large number of peers that frequently change their UDP ports, and there are a few IDs that repeat for a large number of times and all peers with these IDs do not respond to Kad protocol. We also analyze the effects of ID repetitions under simplified settings and find that the current repetition degrades Kad's performance on publishing and searching, but has insignificant effect on lookup process. These measurement and analysis are useful to further determine the sources of repetitions and are also useful for finding suitable parameters in publishing and searching processes in DHT networks without compulsive ID uniqueness. © 2010 The Author Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.|
|Source Title:||Computer Journal|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 19, 2018
checked on May 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.