Memory Efficient Forwarding Information Base for Content-Centric Networking

Content-Centric Networking (CCN) is a new paradigm for the future Internet where content is addressed by hierarchically organized names with the goal to replace TCP/IP networks. Unlike IP addresses, names have arbitrary length and are larger than the four bytes of IPv4 addresses. One important data structure in CCN is the Forwarding Information Base (FIB) where prefixes of names are stored together with the forwarding face. Long prefixes create problems for memory constrained Internet of Things (IoT) devices. In this work, we derive requirements for a FIB in the IoT and survey possible solutions. We investigate, design and compare memory-efficient solutions for the FIB based on hashes and Bloom-Filters. For large number of prefixes and an equal distribution of prefixes to faces we recommend a FIB implementation based on Bloom-Filters. In all other cases, we recommend an implementation of the FIB with hashes.

[1]  George Pavlou,et al.  Hash-routing schemes for information centric networking , 2013, ICN '13.

[2]  Athanasios V. Vasilakos,et al.  TB2F: Tree-bitmap and bloom-filter for a scalable and efficient name lookup in Content-Centric Networking , 2014, 2014 IFIP Networking Conference.

[3]  Fabian Oehlmann,et al.  Content-Centric Networking , 2013 .

[4]  Gwendal Simon,et al.  DiPIT: A Distributed Bloom-Filter Based PIT Table for CCN Nodes , 2012, 2012 21st International Conference on Computer Communications and Networks (ICCCN).

[5]  Horst Hellbrück,et al.  Architecture and message processing for name-centric services in wireless sensor networks , 2016, 2016 Advances in Wireless and Optical Communications (RTUWO).

[6]  Bengt Ahlgren,et al.  A survey of information-centric networking , 2012, IEEE Communications Magazine.

[7]  Jon Crowcroft,et al.  I(FIB)F: Iterated bloom filters for routing in named data networks , 2016, 2017 International Conference on Networked Systems (NetSys).

[8]  Diego Perino,et al.  Caesar: A content router for high-speed forwarding on content names , 2012, 2014 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

[9]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[10]  Sarang Dharmapurikar,et al.  Longest prefix matching using bloom filters , 2006, IEEE/ACM Transactions on Networking.

[11]  Tahir Ahmad,et al.  Randomness testing of non-cryptographic hash functions for real-time hash table based storage and look-up of URLs , 2014, J. Netw. Comput. Appl..

[12]  George Xylomenos,et al.  Reducing forwarding state in content-centric networks with semi-stateless forwarding , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[13]  Andrei Broder,et al.  Network Applications of Bloom Filters: A Survey , 2004, Internet Math..

[14]  Zachary A. Kissel,et al.  Introduction to Network Security: Theory and Practice , 2015 .