A measurement-based analysis of multihoming
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On the cost of caching locator/ID mappings
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Evaluating the benefits of the locator/identifier separation
Proceedings of 2nd ACM/IEEE international workshop on Mobility in the evolving internet architecture
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
LISP-DHT: towards a DHT to map identifiers onto locators
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
A Novel DHT-Based Network Architecture for the Next Generation Internet
ICN '09 Proceedings of the 2009 Eighth International Conference on Networks
HAIR: hierarchical architecture for internet routing
Proceedings of the 2009 workshop on Re-architecting the internet
LISP-TREE: a DNS hierarchy to support the lisp mapping system
IEEE Journal on Selected Areas in Communications - Special issue title on scaling the internet routing system: an interim report
Integration of LISP and LISP-MN into INET
Proceedings of the 5th International ICST Conference on Simulation Tools and Techniques
An analytical model for the LISP cache size
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
A survey and taxonomy of ID/Locator Split Architectures
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The locator/identifier split is a design principle for new routing architectures that make Internet routing more scalable. To find the location of a host, it requires a mapping system that returns appropriate locators in response to maprequests for specific identifiers. In this paper, we propose FIRMS, a "Future Internet Routing Mapping System". It is fast, scalable, reliable, secure, and it is able to relay initial packets. We introduce its design, show how it deals with partial failures, explain its security concept, and evaluate its scalability.