Distributed Hash Queues: Architecture and Design

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...

Full description

Saved in:
Bibliographic Details
Published inAgents and Peer-to-Peer Computing pp. 28 - 39
Main Authors Yoshikawa, Chad, Chun, Brent, Vahdat, Amin
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2005
Springer
SeriesLecture Notes in Computer Science
Subjects
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Distribute Hash Table
Exact sciences and technology
Gateway Node
NATed Node
Queue State
Rendezvous Node
Software
Peer to peer
Multiagent system
Transmission protocol
Hashing
Routing protocols
Distributed system
Communication network
Data structure
Distributed computing
Queue
Delay
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:3540297553
9783540297550
ISSN:0302-9743
1611-3349
DOI:10.1007/11574781_3