Best Paper Award
Efficient Lookup Scheme for Non-aggregatable Name Prefixes and Its Evaluation
Masaki Fukushima, Atsushi Tagami, Toru Hasegawa
[Trans. Commun., Vol. E96-B No.12, Dec. 2013]

Masaki Fukushima

Atsushi Tagami

Toru Hasegawa
 
  Recently, Information-Centric Networking (ICN) and Content-Centric Networking (CCN) are gaining more and more attention as fundamental architectures of the future Internet. In ICN/CCN, any information exchanged through the network is given a hierarchical name that is used to route packets requesting the information toward its source by longest prefix matching. Such a name-based routing scheme affords various benefits including efficient content delivery, mobility, and multihoming. On the other hand, as opposed to conventional IP addresses, information names are independent of their locations in the network topology, and thus their prefixes are difficult to aggregate. This poses a serious scaling issue on the efficiency of looking up names in a huge Forwarding Information Base (FIB) by longest prefix matching.
  In this paper, the authors propose a new scheme for efficiently looking up non-aggregatable name prefixes in a large FIB. The proposed scheme is based on the observation that the bottleneck of FIB lookup is the random accesses to the high-latency off-chip DRAM and this can be reduced by ex-ploiting the information on the longest matching prefix length in the previous hop. Furthermore, an evaluation model of the proposed scheme is also presented and the proposed scheme is quantitatively evaluated on the basis of reasonable assumptions on the future network and topology data of today's Internet. While the proposed scheme significantly improves the FIB lookup latency, its complexity is very low, which facilitates its efficient implementation and broad applications.
  As stated above, in this paper, the key issue on the scalability of the future Internet architecture is clearly identified, a novel method to overcome the issue is proposed, and also, the effectiveness of the method is established through clear and technically sound discussions. Accordingly, this paper deserves the IEICE Best Paper Award.

Close