Towards Scalable Mobility in Distributed Hash Tables
Towards Scalable Mobility in Distributed Hash Tables
复制标题
实现分布式哈希表的可扩展移动性
DOI：
--
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
Klaus Wehrle
中科院分区：
文献类型：
--
作者：
O. Landsiedel;S. Götz;Klaus Wehrle
对于在因特网域中的使用，分布式哈希表（DHT）已被证明是分布式内容存储和访问的有效且可扩展的方法。在本文中，我们将探讨如何DHT和移动的ad-hoc网络（MANDO）适合在一起。我们认为，这两个共享的自组织，权力下放，冗余的要求，和有限的基础设施方面的关键特征。然而，节点的移动性和不断变化的物理拓扑结构提出了一个特殊的挑战，可扩展性和设计的移动的ad-hoc网络的分布式哈希表。在本文中，我们表明，与一些本地知识，我们可以建立一个可扩展的和移动的结构的对等网络，称为移动的哈希表（MHT）。此外，我们认为，很少的全球知识，如城市地图或任何地区的节点移动，甚至可以进一步提高可扩展性和减少维护开销显着，使MHT的规模高达数万个节点
For the use in the Internet domain, distributed hash tables (DHTs) have proven to be an efficient and scalable approach to distributed content storage and access. In this paper, we explore how DHTs and mobile ad-hoc networks (MANETs) fit together. We argue that both share key characteristics in terms of self organization, decentralization, redundancy requirements, and limited infrastructure. However, node mobility and the continually changing physical topology pose a special challenge to scalability and the design of a DHT for mobile ad-hoc networks. In this paper, we show that with some local knowledge we can build a scalable and mobile structured peer-to-peer network, called mobile hash table (MHT). Furthermore, we argue that with little global knowledge, such as a map of the city or whatever area the nodes move in, one can even further improve the scalability and reduce DHT maintenance overhead significantly, allowing MHT to scale up to several ten thousands of nodes