Name
Abstract | ||
|---|---|---|
The Chord protocol is the best known example of implementation of logarithmic complexity routing for structured peer-to-peer networks. Its routing algorithm, however, does not provide an optimal trade-off between the size of the finger table and the average number of hops to reach destination. Lately, a base-k chord appeared based on the original Chord, the routing perfomence of this system improved highly. In the paper, we presented a bidirectional chord system based on the base-k finger table, showing how to construct an improved finger table through the front and back direction, the aim is to reduce the average number of hops, possibly at the expense of an increased size of the finger table and the update time when a node join. Finally, the experimental result of the routing performance shows that our algorithm's is more effective than the base-k chord's. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ISCSCT.2008.55 | ISCSCT (1) |
Keywords | Field | DocType |
chord protocol,protocols,base-k finger table,original chord,routing efficiency,routing algorithm,improved finger table,bidirectional chord system,bidirectional chord protocol system,average number,file organisation,distributed hashing table,finger table,peer-to-peer computing,telecommunication network routing,logarithmic complexity routing,p2p networks,base-k chord,table lookup,structured peer-to-peer network,routing,scalability | Pastry,Computer science,Computer network,Peer to peer computing,Algorithm,Logarithm,Chord (music),Routing table,Routing algorithm,Chord (peer-to-peer),Scalability | Conference |
Volume | ISBN | Citations |
1 | 978-1-4244-3746-7 | 2 |
PageRank | References | Authors |
0.43 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huayun Yan | 1 | 2 | 0.77 |
| Yunliang Jiang | 2 | 134 | 22.20 |
| Xinmin Zhou | 3 | 76 | 5.85 |