A Multicast Routing Algorithm Under the Delay-Restricted Network Environment

Nowadays, the network is expected to service much more multimedia data with the improvement of the network communication bandwidth and development of the processing capacity. In the multicasting communication system, once every receiving end separately sends the data packets, the network resources intend to be wasted, and the calculating stress on the nodes is also going to be increased. A distributed delay-restricted multicast route heuristic method DMPH (delay-constrained minimal-cost path heuristic) is presented in this article. This algorithm proposed in the article can achieve a convergence speed, back up dynamic multicast, and offer the pretty good the network overhead performance. In order to gain the better performance of the network cost, the article firstly proposes a mathematical topological model of the problem over the delay-constrained multicast routing, and then presents a dynamic multicast delay-restricted multicast route algorithm which is called DMPH (Delay-Constrained Minimal-Cost Path Heuristic), fast-convergent and distributed. The computing simulation results suggest that the method pro-posed can gain the better performance of the network cost. In addition, the article just addressed the operation of the addition and quit of the nodes on the dynamic varying of the multicast group, but not concerned the over-head optimal. These problems mentioned above are all our future research work.

1. 1.

   \( P(d_{i} ,T) \) It can be calculated from a delay-limited unicast routing algorithm, which does not mean absolute optimization.

2. 2.

   Inform contains T2D and a message informing T2D [d_i]. tree node to establish a minimum overhead path to node d_i that satisfies the delay.

3. 3.

   Route: to look for a multicast routing tree initiated from a source node that covers all destination nodes;

4. 4.

   Connection Configuration: New connections are configured for each node on the tree, including reserving network resources and registering a new connections in a switching table.

This research was financially supported via Project of the National Natural Science Foundation of China (61402069), the 2017 Project of the Natural Science Foundation of Liaoning province (20170540059), the General project of Liaoning education department in 2016 (2016J205).

Authors and Affiliations

1. Information Science and Engineering College, Dalian Polytechnic University, Dalian, 116034, China

   Jinpeng Wang, Xin Guan, Yang Zhou, Fan Cao & Nianyu Zou

Corresponding author

Correspondence to Jinpeng Wang .

Editors and Affiliations

1. Heilongjiang University of Science and Technology, Harbin, China

   Xiaolin Jiang

2. Dalian Polytehnic University, Dalian, China

   Peng Li

Reprints and permissions

© 2020 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

Policies and ethics