Super node routing strategy in content-centric networking

Abstract

There were two strategies for the data forwarding in the content-centric networking (CCN): forwarding strategy and routing strategy. Forwarding strategy only considered a separated node rather than the whole network performance, and Interest flooding led to the network overhead and redundancy as well. As for routing strategy in CCN, each node was required to run the protocol. It was a waste of routing cost and unfit for large-scale deployment. This paper presents the super node routing strategy in CCN. Some super nodes selected from the peer nodes in CCN were used to receive the routing information from their slave nodes and compute the face-to-path to establish forwarding information base (FIB). Then FIB was sent to slave nodes to control and manage the slave nodes. The theoretical analysis showed that the super node routing strategy possessed robustness and scalability, achieved load balancing, reduced the redundancy and improved the network performance. In three topologies, three experiments were carried out to test the super node routing strategy. Network performance results showed that the proposed strategy had a shorter delay, lower CPU utilization and less redundancy compared with CCN.

Keywords

content-centric networking / routing strategy / super nodes / slave nodes

References

[1] Lua E K, Crowcroft J, Pias M, et al. A survey and comparison of peer-to-peer overlay network schemes [J]. IEEE Communications Surveys and Tutorials, 2005, 7(1–4): 72-93.

[2] Pushp S, Cho T H, Han J, et al. An efficient way to track peers in mobile P2P network[C]. Proceedings of the 18th Annual International Conference on Mobile Computing and Networking, 2012, 431-434.

[3] Doulkeridis C, Vlachou A, Nørvåg K, et al. Efficient search based on content similarity over self-organizing P2P networks[J]. Peer-to-Peer Networking and Applications, 2010, 3(1): 67-79.

[4] Fan L, Trinder P, Taylor H. Design issues for peer-to-peer massively multiplayer online games[J]. International Journal of Advanced Media and Communication, 2010, 4(2): 108-125.

[5] CCNx. CCNx protocol[EB/OL]. https://www.ccnx.org.

[6] NDN. Named Data Networking Project[EB/OL]. http://named-data.net.

[7] Yi C, Afanasyev A, Moiseenko I, et al. A case for stateful forwarding plane[J]. Computer Communications, 2013, 36(7): 736-749.

[8] Shanbhag S, Schwan N, Rimac I, et al. SoCCeR: Services over content-centric routing[C]. ACM SIGCOMM Information-Centric Networking (ICN) Workshop, 2011.

[9] OSPFN: An OSPF Based Routing Protocol for Named Data Networking[EB/OL]. http://named-data.net/publications/techreports/trospfn/.

[10] Hoque A K M, Amin S O, Alyyan A, et al. NLSR: Named-Data link state routing protocol[C]. Proceedings of the 3rd ACM SIGCOMM Workshop on Information-Centric Networking, 2013, 15-20.

[11] Cabral C M S, Rothenberg C E, Magalhaes M F. Mini-CCNx: p Fast Prototyping for Named CCN Data Networking[C]. Proceedings of the ACM SIGCOMM 2013 Workshop on Information-Centric Networking(ICN 2013), 2013, 33-34.

[12] Livesey J. Inter-process communication and naming in the mininet system[C]. IEEE Spring Compcon, 1979, 79: 222-229.

[13] Cabral C, Rothenberg C E, Magalhães M F. Mini-CCNx: fast prototyping for named Data networking[C]. Proceedings of the 3rd ACM SIGCOMM Workshop on Information-Centric Networking, 2013, 33-34.

[14] Cabral C, Rothenberg C E, Magalhães M F. Reproducing real NDN experiments using mini-CCNx[C]. Proceedings of the 3rd ACM SIGCOMM Workshop on Information-Centric Networking, 2013, 45-46.