ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

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

상세정보

학술지 Improving Routing Table Lookup in Software Routers
Cited 5 time in scopus Download 1 time Share share facebook twitter linkedin kakaostory
저자
이현용, Akihiro Nakao
발행일
201504
출처
IEEE Communications Letters, v.19 no.6, pp.957-960
ISSN
1089-7798
출판사
IEEE
DOI
https://dx.doi.org/10.1109/LCOMM.2015.2418759
협약과제
15MI2200, (통합)스마트 네트워킹 핵심 기술 개발, 양선희
초록
For the speed-up in the routing table lookup in software routers, we introduce a new data structure called, sTable that achieves space efficiency while causing low processing overhead without hardware parallelism. Using a hash table-like approach, sTable stores only next hop information to handle most packets within the on-chip fast memory while causing some accesses to the off-chip slow memory to handle lookup errors. Routing table lookup experiments using Click show that, causing less processing overhead and a smaller number of lookup errors than Bloom filter, sTable reduces the average table lookup time by 44% (i.e., from 119 ns to 67 ns) compared to Bloom filter.
키워드
on-chip fast memory, processing and memory access overhead, Routing table lookup, software router
KSP 제안 키워드
Bloom Filter, Data structure, Hardware parallelism, Hash table, Memory Access, On-chip, Routing table lookup, Software Router, Space efficiency, Speed-up, Table-like