HKad: A Hierarchical Kademlia Model

Li Yan

doi:10.4028/www.scientific.net/AMM.457-458.834

Paper Titles

Research on the Algorithm of Intelligent Test System
p.811

Evaluation of Measurement Uncertainty from Imperfect Data
p.815

Medium Access Control Based on Adaptive Sleeping and Probabilistic Routing for Delay Tolerant Mobile Sensor Networks
p.821

A Distributed Peer to Peer Simulator
p.830

HKad: A Hierarchical Kademlia Model
p.834

Scheduling System for Cloud Federation across Multi-Data Center
p.839

Research on Ship Course Control Based on Course Signal Filter
p.844

Multitarget Track-Before-Detect via MeMBer Filtering and Track Consistency Test
p.848

Robust Control of Uncertain Singular Systems with Distributed Delays
p.856

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 457-458HKad: A Hierarchical Kademlia Model

HKad: A Hierarchical Kademlia Model

Abstract:

This paper proposed a new structural overlay model HKad. This model employs layered structure, and when constructing the network logical topology of peer nodes, it can detect rock-bottom physical network logical topology fast and efficiently and make it suitable to the rock-bottom network environment, and make the former be consistent to the latter as much as possible and then improve the whole performance of the systems. The goal is to construct a topology-aware overlay network, and improve the finding speed of information, and reduce unnecessary data transmission in networks.

You might also be interested in these eBooks

Frontiers of Mechanical Engineering and Materials Engineering II

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 457-458)

Pages:

834-838

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.457-458.834

Citation:

Cite this paper

Online since:

October 2013

Authors:

Li Yan

Keywords:

Hierarchical Distributed Hash Table, Network Topology, Overlay Network, Peer-to-Peer Network

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Dabek F， Li J， Sit E， Robertson J， Kaashoek MF， Morris R. Designing a DHT for low latency and high throughput. In： Proc. of the 1st USENIX Symposium. on Networked Systems Design and Implementation(NSDI 2004). San Francisco： USENI Press， (2004).

Google Scholar

[2] P. Maymounkov and D. Mazieres. Kademlia： A peer to peer information system based on the XOR metric. In Proceedings of IPTPS02, Cambridge, USA, March (2002).

DOI: 10.1007/3-540-45748-8_5

Google Scholar

[3] Shen HY, Xu CZ, Ghen G. Cycloid： A constant-degree and lookup-efficient P2P overlay network. In： Panda DK, Duato J, Stunkel C, eds. Proc. of the 18th Int'l Parallel and Distributed Processing Symp. (IPDPS 2004). New York： IEEE Press, 2004. 26−30.

DOI: 10.1109/ipdps.2004.1302935

Google Scholar

[4] Frank, D., et al. Vivaldi: a decentralized network coordinate system, in IEEE SIGCOMM. 2005: Portland, Oregon, USA.

Google Scholar

[5] P. Francis,S. Jamin,C. Jin,Y. Jin,D. Raz,Y. Shavitt, and L. Zhang, IDMaps: A Global Internet Host Distance Estimation Service, IEEE/ACM Transaction on Network, 9(5), pp.525-540, October (2001).

DOI: 10.1109/90.958323

Google Scholar

[6] Chundang Xu, Research on Kademlia Protocol in Structured P2P Network, Beijing University of Posts and Telecommunications , (2010).

Google Scholar