Core-based Shared Tree Multicast Routing Algorithms for LEO Satellite IP Networks

Abstract

A new core-based shared tree algorithm, viz core-cluster combination-based shared tree (CCST) algorithm and the weighted version (i.e. w-CCST algorithm) are proposed in order to resolve the channel resources waste problem in typical source-based multicast routing algorithms in low earth orbit (LEO) satellite IP networks. The CCST algorithm includes the dynamic approximate center (DAC) core selection method and the core-cluster combination multicast route construction scheme. Without complicated onboard computation, the DAC method is uniquely developed for highly dynamic networks of periodical and regular movement. The core-cluster combination method takes core node as the initial core-cluster, and expands it stepwise to construct an entire multicast tree at the lowest tree cost by a shortest path scheme between the newly-generated core-cluster and surplus group members, which results in great bandwidth utilization. Moreover, the w-CCST algorithm is able to strike a balance between performance of tree cost and that of end-to-end propagation delay by adjusting the weighted factor to meet strict end-to-end delay requirements of some real-time multicast services at the expense of a slight increase in tree cost. Finally, performance comparison is conducted between the proposed algorithms and typical algorithms in LEO satellite IP networks. Simulation results show that the CCST algorithm significantly decreases the average tree cost against to the others, and also the average end-to-end propagation delay of w-CCST algorithm is lower than that of the CCST algorithm.