| dc.contributor.author |
Dang, N.B. |
|
| dc.contributor.author |
Vu, S.T. |
|
| dc.contributor.author |
Nguyen, H.S. |
|
| dc.date.accessioned |
2011-05-10T03:29:14Z |
|
| dc.date.available |
2011-05-10T03:29:14Z |
|
| dc.date.issued |
2009 |
|
| dc.identifier.citation |
Page : 195-200 |
vi |
| dc.identifier.isbn |
9.78E+12 |
|
| dc.identifier.uri |
http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/7384 |
|
| dc.description.abstract |
DHT-based P2P networks have a problem of topology mismatch which causes high latency for
message routing. This paper focuses on improving the latency of routing process for Chord, which is a
typical DHT-based P2P network protocol. We propose a simple method to build a Chord network based on
the proximity of nodes in the underlying physical network. The idea of our method is the combination of
two techniques: identifier selection in node joining phase and neighbor selection in network stabilization
phase, both are performed based on physical network latency. We have evaluated our proposed solution by
simulations. In a simulation network with 4096 nodes, the average latency of routing process in our method
can reduces 30% comparing with the conventional Chord routing method. ?? 2009 IEEE. |
vi |
| dc.language.iso |
en |
vi |
| dc.publisher |
KSE 2009 - The 1st International Conference on Knowledge and Systems Engineering |
vi |
| dc.subject |
Proximity-aware |
vi |
| dc.subject |
DHT |
vi |
| dc.subject |
Chord |
vi |
| dc.subject |
Low latency |
vi |
| dc.title |
Building a low-latency, proximity-aware DHT-based P2P network |
vi |
| dc.type |
Article |
vi |