2016 年 E99.B 巻 12 号 p. 2498-2508
Information-centric networking (ICN) has been investigated as a new communication model that is optimal for data registration and retrieval. A promising application of ICN is mobile machine-to-machine (M2M) communication in which data are registered by M2M terminals, such as vehicles, and retrieved by other M2M terminals. One of the most difficult challenges with ICN is achieving data mobility in which the data are registered by moving terminals and the location of the data changes constantly. To gain access to moving data, the data retrieval messages must access the routing information, which results in a high volume of message transaction loads of high-tier nodes such as the name resolution nodes. We previously proposed a scheme called data-centric network (DCN), which mitigates this problem by allocating multiple intermediate nodes that act as route aggregation points and by establishing optimized routes. In this paper, we compare the transaction load of DCN with those of conventional ICN schemes using theoretical evaluation based on probability calculation. We also compare the amount of route information and transaction loads using a simulator against binary tree and ISP backbone topologies. From these evaluations, we clarify the characteristics of each ICN scheme in different terminal distribution and communication patterns and show that DCN reduces the transaction loads of high-tier nodes when the terminals are communicating locally.
