Please use this identifier to cite or link to this item: https://doi.org/10.1109/P2P.2009.5284551
Title: ID repetition in kad
Authors: Yu, J.
Fang, C.
Xu, J.
Chang, E.-C. 
Li, Z.
Issue Date: 2009
Source: Yu, J., Fang, C., Xu, J., Chang, E.-C., Li, Z. (2009). ID repetition in kad. IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing : 111-120. ScholarBank@NUS Repository. https://doi.org/10.1109/P2P.2009.5284551
Abstract: ID uniqueness is essential in DHT-based systems as peer lookup and resource searching rely on IDmatching. Many previous works and measurements on Kad do not take into account that IDs among peers may not be unique. We observe that a significant portion of peers, 19.5% of the peers in routing tables and 4-5% of the active peers (those who respond to Kad protocol), do not have unique IDs. These repetitions would mislead the measurements of Kad network. We further 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 analyze the effects of ID repetitions under simplified settings and find that ID repetition degrades Kad's performance on publishing and searching, but has insignificant effect on lookup process. These measurement and analysis are useful in determining the sources of repetitions and are also useful in finding suitable parameters for publishing and searching. ©2009 IEEE.
Source Title: IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing
URI: http://scholarbank.nus.edu.sg/handle/10635/40312
ISBN: 9781424450671
DOI: 10.1109/P2P.2009.5284551
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

25
checked on Dec 6, 2017

WEB OF SCIENCETM
Citations

8
checked on Nov 18, 2017

Page view(s)

66
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.