A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
DNS performance and the effectiveness of caching
IEEE/ACM Transactions on Networking (TON)
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Improved Online/Offline Signature Schemes
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
OpenDHT: a public DHT service and its uses
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Maintaining Strong Cache Consistency for the Domain Name System
IEEE Transactions on Knowledge and Data Engineering
On the cost of caching locator/ID mappings
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Short-Term and Long-Term Computing Models of Internet Diameter
ICICSE '08 Proceedings of the 2008 International Conference on Internet Computing in Science and Engineering
Accountable internet protocol (aip)
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Six/one router: a scalable and backwards compatible solution for provider-independent addressing
Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture
TVA: a DoS-limiting network architecture
IEEE/ACM Transactions on Networking (TON)
A DHT-Based Identifier-to-Locator Mapping Approach for a Scalable Internet
IEEE Transactions on Parallel and Distributed Systems
Broadband wireless access with WiMax/802.16: current performance benchmarks and future potential
IEEE Communications Magazine
Hi-index | 0.00 |
In order to address the scalability issue of the Internet routing architecture, there is a growing consensus that it is necessary to separate the locator role and the identifier role of IP addresses. When identifiers are separated from locators, a critical challenge is how to design an identifier-to-locator mapping service to map identifiers onto locators. While many mapping services have been proposed in the literature, they are designed based on either the structure or the hash of identifiers. That is, they are all designed based on identifiers. A result of such design choices is that users of identifiers do not have the freedom to choose where to store their identifier-to-locator mappings. In this paper, we argue that an identifier-to-locator mapping service should offer users of identifiers the freedom to choose where to store their mappings. For this purpose, we propose to decouple the design of identifier-to-locator mapping services from identifiers. In particular, our research results show that, by setting a set of identifier-to-locator mapping service providers (MSPs) and letting the users of identifiers choose their preferred/trusted MSPs, we can design an elegant mapping service to map identifiers onto locators.