Analysis and Improvement of Chord Protocol

Author

Biqing, Wang

Author_Institution

Dept. of Math. & Comput. Sci., Tongling Univ. Tongling, Tongling, China

fYear

2012

fDate

11-13 Aug. 2012

Firstpage

702

Lastpage

705

Abstract

According to Chord protocol of P2P network, entries in the routing table are placed at a long distances that are all powers of 2 and only cover half of the identifier space. Therefore, an improved Chord routing algorithm is proposed. The algorithm presents a new routing table structure formula, increases entries distribution density, and extends routing searching coverage areas. Performance analysis and simulation experiments show that improved algorithm reduces the average lookup path length and gets higher efficiency.

Keywords

computer network performance evaluation; peer-to-peer computing; routing protocols; Chord protocol analysis; Chord protocol improvement; P2P networks; average lookup path length reduction; entry distribution density; identifier space; improved Chord routing algorithm; performance analysis; routing search coverage areas; routing table structure formula; simulation experiments; Algorithm design and analysis; Network topology; Peer to peer computing; Protocols; Routing; Topology; Chord; P2P network; algorithm; routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science & Service System (CSSS), 2012 International Conference on

Conference_Location

Nanjing

Print_ISBN

978-1-4673-0721-5

Type

conf

DOI

10.1109/CSSS.2012.181

Filename

6394419