MK：一种解决拓扑匹配的DHT模型
MK：A Topology Matched DHT Model
在结构化P2P系统中，由于使用DHT技术构建逻辑覆盖图时没有考虑实际物理层的拓扑结构，从而导致覆盖网与物理网络的严重失配，使得逻辑上相邻节点的延迟远远大于其物理上的延迟。本文针对DHT的拓扑失配问题，提出了一个解决拓扑匹配的DHT模型：TMK。分析认为，该模型能很好的解决了拓扑失配问题、缩小节点路由表空间、提高了路由查询效率。
In the structured P2P systems, they didn’t take the physical topology into account when constructing the logical overlay because of the using of DHT technology, this induced the mismatch between the overlay and physical network, made the logical latency greater than the physical latency. To solve the mismatch problem, a topology matching DHT model, TMK, is proposed. Through analysis, TMK solved the mismatching problem availably, reduced the router table space, improved the routing efficiency.
马志新、田中彬、蔡军卫、杨金霞、潘伟国
计算技术、计算机技术
P2P、IPv6、Kademlia、分布式哈希表、拓扑匹配
P2P IPv6 Kademlia Distributed Hash Table Topology matching
马志新,田中彬,蔡军卫,杨金霞,潘伟国.MK：一种解决拓扑匹配的DHT模型[EB/OL].(2008-02-29)[2025-08-16].http://www.paper.edu.cn/releasepaper/content/200802-389.点此复制
评论