The Security Routing Based on Convergence Detected about Route in DHT

Author

Wang Feng ; Li Ya ; Li Xiao Jian

Author_Institution

Dept. of Comput. Sci., Zhou Kou Normal Univ., Zhoukou, China

Volume

1

fYear

2011

fDate

14-15 May 2011

Firstpage

321

Lastpage

325

Abstract

In order to reduce the harm of malicious nodes to the DHT network, the paper makes analysis about the DHT routing algorithm, we get the iteration function of routing on DHT. Through the analysis on iterative routing functions, we summarize the common features of malicious nodes which undermine the convergence of the DHT routing, so we design a security routing model based on convergence detected about route in DHT, which was be named SDRM. Then we design a security routing algorithm CSDSR, according to SDRM and chord. In the end, we carry out simulations to test the performance of CSDSR.

Keywords

computer network security; convergence of numerical methods; cryptography; iterative methods; peer-to-peer computing; telecommunication network routing; CSDSR; DHT network; DHT routing algorithm; SDRM; convergence detection; iterative routing function; malicious node; security routing model; Algorithm design and analysis; Convergence; Feature extraction; Peer to peer computing; Protocols; Routing; Security; DHT; iterative routing; malicious nodes;

fLanguage

English

Publisher

ieee

Conference_Titel

Network Computing and Information Security (NCIS), 2011 International Conference on

Conference_Location

Guilin

Print_ISBN

978-1-61284-347-6

Type

conf

DOI

10.1109/NCIS.2011.72

Filename

5948742