ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술대회 An Efficient Lookup Mechanism for Hierarchical ID Mapping System
Cited 0 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
곽병옥, 정희영
발행일
201310
출처
International Conference on Information and Communication Technology Convergence (ICTC) 2013, pp.981-983
DOI
https://dx.doi.org/10.1109/ICTC.2013.6675535
협약과제
13ZI1100, 유무선 빅 네트워크 워천기술 개발, 안치득
초록
The Identity (ID) and Locator (LOC) separation principle is an important concept to both the current Internet and the future Internet. A major issue in ID/LOC separation principle is mapping a location-independent ID to a position-specific locator, which is the main function of a system that we define as the ID/LOC Mapping System (IMS). Realizing the IMS is particularly challenging simply because it has to manage a large number of IDs in the Internet; thus, it is important to design an IMS that has high scalability and performance. In this paper, we propose a scalable and efficient IMS where we achieve scalability through hierarchical structuring of the IMS and high performance through the use of the bloom filter. © 2013 IEEE.
KSP 제안 키워드
Bloom Filter, Efficient lookup, Hierarchical structuring, High performance, ID/Loc separation, future internet, high scalability, mapping system, separation principle