Compact distributed data structures for adaptive routing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Serving DNS Using a Peer-to-Peer Lookup Service
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Structured Superpeers: Leveraging Heterogeneity to Provide Constant-Time Lookup
WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
Estimating frequency of change
ACM Transactions on Internet Technology (TOIT)
Canon in G Major: Designing DHTs with Hierarchical Structure
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
The design and implementation of a next generation name service for the internet
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Cyclone: A Novel Design Schema for Hierarchical DHTs
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
A data-oriented (and beyond) network architecture
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
A Comparative Study of Hierarchical DHT Systems
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
Proceedings of the 17th international conference on World Wide Web
Anycast-aware transport for content delivery networks
Proceedings of the 18th international conference on World wide web
LISP-DHT: towards a DHT to map identifiers onto locators
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Where Is My Peer? Evaluation of the Vivaldi Network Coordinate System in Azureus
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
On name-based inter-domain routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
A new and effective hierarchical overlay structure for Peer-to-Peer networks
Computer Communications
MDHT: a hierarchical name resolution service for information-centric networks
Proceedings of the ACM SIGCOMM workshop on Information-centric networking
Communications of the ACM
Providing administrative control and autonomy in structured peer-to-peer overlays
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Network of Information (NetInf) - An information-centric networking architecture
Computer Communications
Hi-index | 0.24 |
Information-centric network (ICN) architectures are an increasingly important approach for the future Internet. Several ICN approaches are based on a flat object ID namespace and require some kind of global name resolution service to translate object IDs into network addresses. Building a world-wide NRS for a flat namespace with 10^1^6 expected IDs is challenging because of requirements such as scalability, low latency, efficient network utilization, and anycast routing that selects the most suitable copies. In this paper, we present a general hierarchical NRS framework for flat ID namespaces. The framework meets those requirements by the following properties: The registration and request forwarding matches the underlying network topology, exploits request locality, supports domain-specific copies of binding entries, can offer constant hop resolution (depending on the chosen underlying forwarding scheme), and provides scoping of publications. Our general NRS framework is flexible and supports different instantiations. These instantiations offer an important trade-off between resolution-domain (i.e. subsystem) autonomy (simplifying deployment) and reduced latency, maintenance overhead, and memory requirements. To evaluate this trade-off and explore the design space, we have designed two specific instantiations of our general NRS framework: MDHT and HSkip. We have performed a theoretical analysis and a simulation-based evaluation of both systems. In addition, we have published an implementation of the MDHT system as open source. Results indicate that an average request latency of (well) below 100ms is achievable in both systems for a global system with 12 million NRS nodes while meeting our other specific requirements. These results imply that a flat namespace can be adopted on a global scale, opening up several design alternatives for information-centric network architectures.