Interest forwarding in CoLoR: A baseline implementation and performance evaluation
Xingbeng Wen, Hongbin Luo, Yi Bing Lin · 2016
CoLoR is an information-centric Internet architecture in which every piece of content has a unique service identifier (SID) and every domain has a logical centralized resource manager (RM) that maintains an SID table used to record the reachability information of SIDs. When a client wants to obtain a piece of content represented by an SID, it sends an Interest (or GET) packet containing the SID to the network. The network then routes the GET packet domain-by-domain toward the content provider. In every domain A, the RM will look up its SID table in order to determine the next hop domain B toward the provider, and appends the inter-domain path identifier between domains A and B. Since the number of SID entries are huge and an RM needs to process plenty of GET packets per second, it is interesting to investigate the capability of RMs so as to evaluate the scalability of the CoLoR architecture. In this paper, we present a baseline implementation of RMs based on DPDK by using the optimistic concurrent cuckoo hashing. Our evaluation shows that an RM can process up to 18.3 million GET packets per second, if it is equipped with two 10 Gbps Ethernet interfaces and a 4-core i7 CPU while maintaining a forwarding table of half a billion SID entries. This work lays a solid foundation to evaluate the scalability of the CoLoR architecture.