Optimized Root Selection Algorithm for Many-to-Many Communications in ICN

Abstract

Information-centric networking (ICN) is a promising framework providing data through their names. It is expected that ICN will provide many-to-many communications enabling the efficient content sharing. To provide such many-to-many communications, communication tree structures for different groups need to be constructed on the fly. Consequently, we focus on the tree root deployment and selection for the communication structure establishment: namely, what is the impact of the number of root devices and how to select roots for different groups. We propose an optimized root selection algorithm with low computation power consumption. Through simulations, we show that the number of deployed root devices influences the traffic distribution across the network links greatly. Then we use the proposed algorithm for the root selection for different groups. It is observed that the proposed algorithm can reduce the total traffic overhead compared to the random root selection algorithm.