Design and Implementation of a Hierarchical ID/Locator Mapping System
Authors
-
Trustworthy Networking Research Section, ETRI, 34129, Korea ,KR
Byeong-Ok Kwak -
Department of Software, Chungbuk National University, 28644, Korea ,KRSang-Ho Lee
-
Trustworthy Networking Research Section, ETRI, 34129, Korea ,KRTae-Soo Chung
DOI:
https://doi.org/10.18311/jeoh/2016/15638Keywords:
Bloom Filter, Future Internet, Locator/Identifier Separation, Mapping SystemAbstract
Background/Objectives: The Identifier (ID) and Locator(Loc) split is a key concept in the current Internet environment and the future Internet environment. The binding of ID to Loc is necessary to route/ forward packets, which is called as ID/Loc mapping system. Methods/Statistical analysis: We propose a novel ID/Locator Mapping System (ILMS) mechanism using the bloom filters (BFs) to store information about the identifier. The proposed bloom filters stores the information about the identifiers belonging to the domain managed by the ILMS. Findings: The critical challenge in building the mapping system is scalability simply because the vast number of ID exists in the network and there is no mechanism that can be aggregated as an IP address, since IDs are assumed to be flat. The proposed mapping system is a network of ILMS server in a forest by multiple trees with peering relationship. The main idea is to construct the hierarchical ILMS to manage only a limited number of IDs and so can extract a bit that can be tested for given ID in each ILMS. Improvements/Applications: Scalability issue was addressed by compressing the BFs to indicate the IDs of the child ILMS server.
Downloads
Metrics
References
Jacobson, et al. (2007) Networking named content V. Proceedings of the ACM CoNEXT conference, New York, NY, USA. Association for Computing Machinery (ACM)., 1–12.
Anand, A., et al. (2011) XIA: Architecture for an evolvable and trustworthy internet. In the Proceedings of the 10th ACM Workshop on Hot Topics in Networks (HotNets-X), Cambridge, MA. Association for Computing Machinery (ACM)., Nov 14–15, 2011.
Vu, T., et al. (2012) D Map: a shared hosting scheme for dynamic identifier to locator mappings in the global internet. Institute of Electrical and Electronics Engineers (IEEE) International Conference on Distributed Computing Systems (ICDCS)., Jun, 698–707.
Seskar, I., Nagaraja, K., Nelson S., and Raychaudhuri D. (2011) Mobility first future internet architecture project. In the Proceedings of the 7th Asian Internet Engineering Conference (AINTEC), Bangkok,Thailan., Nov. http://mobilityfirst.winlab.rutgers.edu/
Kwak, B., Lee, T., and Chun, W. (2012) ID based communication in domain-insulated autonomous network architecture (DIANA). ICTC., Oct.
Hong, J., Taewan Y., and Heeyoung J. (2015) Qualitative analysis of mapping systems in the Internet architectures based on identifier/locator separation.International Journal of Parallel Emergent and Distributed Systems., Aug, 31(1), 1–15.
Bloom BH., (1970) Space/time trade-offs in hash coding with allowable errors. Association for Computing Machinery (ACM)., 13(7), 422–6. Article title.http://www.sail-project.eu/,Scalable and Adaptive Internet Solutions (SAIL).
Vu, T., Baid, A., Zhang, Y., Nguyeny, T., Fukuyamaz, J., Martin, R., and Raychaudhuri, D. (2012)DMap: a shared hosting scheme for dynamic identifier to locator mappings in the global internet.In the Proceedings of the Institute of Electrical and Electronics Engineers (IEEE) International Conference on Distributed Computing Systems., 698–707.
Ambrosio, MD., Dannewitz, C., Karl, H., and Vercellone, V. (2011) MDHT: a hierarchical name resolution service for information-centric networks. ICN, Toronto, Ontario, Canada., August 19, 7–12.
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D., Kaashoek, M., Dabek, F., and Balakarishnan, H. (2001) Chord: a scalable peer-to-peer lookup protocol for internet applications. In the Proceedings of the Association for Computing Machinery (ACM) SIGCOMM' 01, San Diego, CA., Aug, 149–60.
Sevedio, VDP., and Caldarelli, G. (2004) Vertex intrinsic fitness: how to produce arbitrary scale-free networks.Physics Review., E70(5), 056–126.
Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S. (2001) A scalable content - addressable network. In the Proceedings of the Association for Computing Machinery (ACM) SIGCOMM, San Diego, CA., Aug, 31(4), 161–72.
Rowstron, A., and Druschel, P. (2001) Pastry: scalable, distributed object location and routing for large scale peer-to-peer systems. 18th IFIP/ Association for Computing Machinery (ACM) International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany., Nov, 1–22.
Faujdar, N., and Ghrera, SP. (2016) Performance evaluation of parallel count sort using GPU computing with CUDA. Indian Journal of Science and Technology., Apr, 9(15), 1–12.
Castro, M., Druschel, P., Hu, YC., and Rowstron, A.(2002) Topology aware routing in structured peertopeer overlay networks. Technical Report MSRTR-2002-82, Microsoft Research., 1–19.
Jung, H., Lim, W., Hong, J., Hur, C., Lee, J., You, T., Eun, J., Kwak, B., Kim, J., Jeon, H., Kim, T., and Chun, W.(2015) IDNet: beyond all-IP network. ETRI Journal., Oct, 37(5), 833–44.
Jayavel, K., and Nagarajan, V. (2016) Survey of migration, integration and interconnection techniques of data centric networks to internet- towards Internet of Things (IoT). Indian Journal of Science and Technology., Feb, 9(11), 1–7.
