Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Canon in G Major: Designing DHTs with Hierarchical Structure
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Efficient routing for peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
A data-oriented (and beyond) network architecture
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 5th international conference on Emerging networking experiments and technologies
LANES: an inter-domain data-oriented routing architecture
Proceedings of the 2009 workshop on Re-architecting the internet
MDHT: a hierarchical name resolution service for information-centric networks
Proceedings of the ACM SIGCOMM workshop on Information-centric networking
Information-centric networking: seeing the forest for the trees
Proceedings of the 10th ACM Workshop on Hot Topics in Networks
Providing administrative control and autonomy in structured peer-to-peer overlays
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
A novel cache aware routing scheme for Information-Centric Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Information-Centric Networking (ICN) has recently attracted research attention, which decouples content from hosts at the network layer, and retrieves a content object by its name (identifier), instead of its storage location (host IP address) in order to address IP network's limitations in supporting content distribution. However, ICN systems face scalability and efficiency challenges in global deployments. In this paper, we propose a scalable routing and name resolution framework, called Scalable Multi-level Virtual Distributed Hash Table (SMVDHT). SMVDHT uses a combination of name aggregation and multi-level virtual DHTs to achieve scalability. A novel aggregation scheme is proposed to reduce the size and update overhead of name resolution tables, while relieving the "suffix-hole" problem encountered in traditional prefix-based name aggregation. Furthermore, SMVDHT exploits underlying intra- and inter-domain IP routing protocols to build multi-level virtual DHTs for name resolution, which is more efficient than conventional hierarchical DHT schemes and simplifies network management. We also design the new protocols to efficiently resolve the aggregated names and forward a request to the closest available copy of content via multi-level virtual DHTs.