The structured P2P system adopts routing algorithms which support a distributed hash table ( DHT ) functionality, locates and searches data objects by precise keywords. 结构化P2P系统采用支持分布式哈希表(DHT)(DHT)的路由算法,根据精确关键字进行对象的定位与发现。
In the peer-to-peer network based on Distributed Hash Table(DHT) ( DHT ), the structure of routing table impacts the efficiency of searching keywords. 在基于分布式哈希表(DHT)构造的对等网络中,路由表的结构影响关键字的查询效率。
They provide a Distributed Hash Table(DHT) ( DHT ) function for mapping keys to overlay nodes. 这些覆盖网络利用分布式哈希表(DHT)(DistributedHashTable,DHT)把关键字映射到覆盖网络的节点中。
The resource location algorithm is a key research and hot spots in P2P network, while the structured distributed hash table algorithm for its unique high-performance and scalability advantages is Studied by more people. P2P网络中的资源定位算法是研究的一个重点和热点,而结构化的分布式哈希表(DHT)算法以其独特的高效和可扩展性强等优势已经被越来越多的人研究。
The Content Addressable Network ( CAN ) is a method to implement the structured P2P network. CAN realizes the efficient mapping of the file information and its storage location by using Distributed Hash Table(DHT) ( DHT ). 内容寻址网络(ContentAddressableNetworkCAN)是结构化P2P的一种实现方案,它使用分布式哈希表(DHT)(DHT)实现了文件信息和它的存储位置的映射。