The week's pick
Random Articles
Reseach Article
A Compact Routing based Mapping System for the Locator/ID Separation Protocol (LISP)
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 127 - Number 5 |
| Year of Publication: 2015 |
| Authors: A.M. Anisul Huq, Hannu Flinck and |
10.5120/ijca2015906380
|
A.M. Anisul Huq, Hannu Flinck and . A Compact Routing based Mapping System for the Locator/ID Separation Protocol (LISP). International Journal of Computer Applications. 127, 5 ( October 2015), 1-8. DOI=10.5120/ijca2015906380
Abstract
The Internet and its associated global routing tables are growing at an alarming rate. Will the current routing infrastructure be able to scale itself to sustain such growth? Over the past several years, many efforts have been made to resolve this important issue. This paper offers a novel solution to this serious problem by proposing and presenting an experimental mapping system called Compact Routing based Mapping (CRM). The idea here is to combine the perceived benefits of both Compact Routing and Locator/Identifier Separation Protocol (LISP). In CRM, the critical functions that affect the scalability of the routing system are grounded to the theory of Compact Routing; so that we might overcome the shortcomings of LISP-ALT. We mitigated Compact Routing’s presumption of a static network by reusing LISP’s registration messages and choosing landmarks dynamically based on their capability to aggregate. The key objective of this paper is to provide proof of concept, to give first-hand experience regarding the complicacies that arise with the actual development of such a mapping system. Our work also includes a comprehensive comparison between CRM and LISP-ALT. The results suggest that, CRM would be feasible in the current Internet if deployed and it would be far less expensive than LISP-ALT.
References
- L. J. Cowen, Compact routing with minimum stretch., Journal of Algorithms 38 (2001), 170 –183.
- D. Farinacci, V. Fuller, D. Meyer, and D. Lewis, Locator/id separation protocol (lisp), Request for Comments, IETF, Internet Engineering Task Force, 2011.
- Dino Farinacci, Darrel Lewis, David Meyer, and Vince Fuller, The locator/id separation protocol (lisp) (2013).
- Hannu Flinck, Petteri Poyhonen, and Johanna Heinonen, Analysis of landmark selection method, 2011.
- V Fuller, D Farinacci, and D Meyer, D. lewis,” locator/id separation protocol alternative logical topology (lisp+ alt), RFC 6836, January, 2013.
- V. Fuller, D. Farinacci, D. Meyer, and D. Lewis, Lisp alternative topology (lisp+alt), Request for Comments, IETF, Internet Engineering Task Force, 2011.
- V Fuller, D Lewis, and D Farinacci, Lisp delegated database tree, draft-fuller-lisp-ddt-01 (work in progress) (2012).
- V. Fuller and T. Li, Classless inter-domain routing (cidr): The internet address assignment and aggregation plan, Request for Comments, IETF, Internet Engineering Task Force, 2006.
- A. M. Anisul Huq, Experimental implementation of a compact routing based mapping system for the locator/id separation protocol (lisp), Master’s Thesis, 2012.
- G Huston, As6447 bgp routing table analysis report. Iannone, Saucez, and Bonaventure, Implementing the locator/id separation protocol: Design and experience, Computer Networks (2011).
- L. Iannone, D. Saucez, and O. Bonaventure, Openlisp implementation report, Internet-Draft, Network Working Group, 2009.
- Varun Khare, Dan Jen, Xin Zhao, Yaoqing Liu, Dan Massey, Lan Wang, Beichuan Zhang, and Lixia Zhang, Evolution towards global routing scalability, IEEE Journal on Selected Areas in Communications 28 (2010October), 1363 –1375. Institute of Computer Science, University of Wrzburg, Germany.
- Graham Mooney, Evaluating compact routing algorithms on realworld networks, Master’s Thesis, 2010.
- Tapio Partti, Improving internet inter-domain routing scalability, Master’s Thesis, 2011.
- Cristel Pelsser, Akeo Masuda, and Kohei Shiomoto, Scalable support of interdomain routes in a single as, Proceedings of the ieee global telecommunications conference, 2009, honolulu., 2009November, pp. 1 –8.
- Damien Saucez, Luigi Iannone, and Olivier Bonaventure, Openlisp: An open source implementation of the locator/id separation protocol, ACM SIGCOMM Demos Session (2009), 1–2.
- Damien Saucez, Luigi Iannone, Olivier Bonaventure, and Dino Farinacci, Designing a deployable internet: The locator/identifier separation protocol, Internet Computing, IEEE 16 (2012), no. 6, 14–21.
- Damien Saucez, Luigi Iannone, and Benoit Donnet, A first measurement look at the deployment and evolution of thelocator/id separation protocol, ACM SIGCOMM Computer Communication Review 43 (2013), no. 1, 37–43.
- M. Thorup and U. Zwick, Compact routing schemes., Proceedings of the 13th annual acm symposium on parallel algorithms and architectures, 2001July, pp. 1 –10.
Index Terms
Keywords