Distributed hash queues: architecture and design
AGENTS AND PEER-TO-PEER COMPUTING（2005）
摘要
We introduce a new distributed data structure, the Distributed-Hash Queue, which enables communication between Network-Address Translated (NATed) peers in a P2P network. DHQs are an extension of distributed hash tables (DHTs) which allow for push and pop operators vs. the traditional DHT put and get operators. We describe the architecture in detail and show how it can be used to build a delay-tolerant network for use in P2P applications such as delayed-messaging. We have developed an initial prototype implementation of the DHQ which runs on PlanetLab using the Pastry key-based routing protocol.
更多查看译文
关键词
p2p network,p2p application,hash table,hash queue,pop operator,initial prototype implementation,traditional dht,data structure,delay-tolerant network,distributed-hash queue,delay tolerant network,p2p,distributed hash table,key based routing
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要