Measuring the Identifier Repetition and Aliasing Phenomena in K Networks

Liu Xiangtao; Li Wenfa; Duan Miyi; Zhao Xinyu; Ji Tongkai

Journal of Computer Research and Development > 2012 > 49(4): 679-690.

Liu Xiangtao, Li Wenfa, Duan Miyi, Zhao Xinyu, Ji Tongkai. Measuring the Identifier Repetition and Aliasing Phenomena in K Networks[J]. Journal of Computer Research and Development, 2012, 49(4): 679-690.

Citation:

PDF (5272 KB)

Measuring the Identifier Repetition and Aliasing Phenomena in K Networks

1(Guangdong Electronics Industry Institute, Dongguan, Guangdong 523808) 2(Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190) 3(Institute of Computing Technology, Beijing Jiaotong University, Beijing 100029)

More Information

Published Date: April 14, 2012

Graphical Abstract

Abstract

Abstract

Kademlia, as a robust distributed Hash table (DHT) protocol, has been deployed by peer-to-peer (P2P) file sharing applications (e.g. BitTorrent and eMule) to facilitate the delivery of content. In this paper, these Kademlia-based networks deployed by BitTorrent and eMule are called K networks. It is essential for each peer in K networks to possess a unique IP address (or ID), on which both “peer lookup” and “resource searching” rely. However, it is noticed that a significant portion of peers have IP repetition and ID aliasing, through our analysis. In this paper, we propose a couple of metrics to deeply understand the distribution characteristics of IP repetition and ID aliasing. Based on these metrics, we carry out a series of measurement using the P2P crawler named Rainbow. We identify many interesting characteristics of IP repetition and ID aliasing in K networks, which could help promote P2P-network mining.
- P2P network,
- Kademlia protocol,
- network measurement,
- IP repetition,
- ID aliasing

FullText(HTML)

References (0)

[1]	Li Mingyue, Luo Xiangyang, Chai Lixiang, Yuan Fuxiang, GanYong. City-Level IP Geolocation Method Based on Network Node Clustering[J]. Journal of Computer Research and Development, 2019, 56(3): 467-479. DOI: 10.7544/issn1000-1239.2019.20170473
[2]	Wang Changda, Huang Lei, Liu Zhifeng. Information Hiding Algorithm of IP Covert Timing Channels and Its Performance Analysis[J]. Journal of Computer Research and Development, 2016, 53(5): 988-999. DOI: 10.7544/issn1000-1239.2016.20150063
[3]	Wang Zhiwei and Zhang Wei. ID Based Signature Scheme from Strong RSA Assumption in the Standard Model[J]. Journal of Computer Research and Development, 2013, 50(2): 302-306.
[4]	Gao Haiying. Provable Secure ID-Based Authenticated Key Agreement Protocol[J]. Journal of Computer Research and Development, 2012, 49(8): 1685-1689.
[5]	Zhou Yousheng, Sun Yanbin, Qing Sihan, Yang Yixian. An Efficient ID-Based Verifiably Encrypted Signature Scheme[J]. Journal of Computer Research and Development, 2011, 48(8): 1350-1356.
[6]	Lai Xin, Huang Xiaofang, He Dake. An ID-Based Efficient Signcryption Key Encapsulation Scheme[J]. Journal of Computer Research and Development, 2009, 46(5): 857-863.
[7]	Zhou Ling, Sun Yamin. Research on Multicast Routing Algorithm for Mobile IP Based on Bone Node Set[J]. Journal of Computer Research and Development, 2008, 45(7): 1126-1132.
[8]	Wang Li, Xu Mingwei, and Xu Ke. On the Deployment Approach of IPSec and IP Filter in Routers[J]. Journal of Computer Research and Development, 2006, 43(3): 375-380.
[9]	Qu Haipeng, Li Dequan, Su Purui, Feng Dengguo. An IP Traceback Scheme with Packet Marking in Blocks[J]. Journal of Computer Research and Development, 2005, 42(12): 2084-2092.
[10]	Wu Yichuan, Huang Kui, Zheng Jianping, Sun Limin, and Cheng Weiming. An Adaptive Robust TCP/IP Header Compression Algorithm[J]. Journal of Computer Research and Development, 2005, 42(4): 655-661.