Route selecting method of new adding multicast member

Abstract

The invention discloses a route-selection method of appended multicast members, which is invented for a multicast tree-branch nodes selection method that is capable of effectively improving time performance. The invention includes: (1) a original node and a destination node are rearranged according to received request of the appended multicast members, and an appended leaf node acts as the original node, and the existing nodes of the multicast tree are added to the destination node assembles; (2) by using a revised shortest route arithmetic, the shortest route from the original node to the nodes of the destination node assembles is calculated, and a branch node is determined; (3) according to an order from the branch node to the leaf node, the multicast route is organized, and the multicast route is matched with an existing route from a root node to the branch node in the multicast tree, and the multicast route of the appended multicast route is obtained. For the invention alters the shortest route arithmetic, a plurality of callings of shortest route arithmetic are avoided, and a time efficiency of the multicast selection route arithmetic is improved and a performance of the system is improved.

Description

technical field [0001] The invention relates to a method for selecting a path for multicast service members in a network. Background technique [0002] Multicast is a means of group communication for transmitting information from one source to multiple destinations. With the emergence and increasing popularity of applications such as video on demand, video conferencing, and distance learning, simple and effective multicasting of broadband signals has become a basic function that the network should have. [0003] To support the multicast service in the network, the point-to-multipoint multicast service can be simply split into multiple point-to-point services, and the shortest path algorithm is used independently for each point-to-point service to determine the service path and transmit the multicast service. Since the services transmitted in the same multicast group are the same, this will undoubtedly lead to a waste of network transmission resources, especially when the nu...

AI Technical Summary

Problems solved by technology

[0005] The disadvantage of the above solution method is that it needs to run the shortest path algorithm multiple times, and then compare the results each time to select the branch point. In the case of a relatively large network topology, the time efficiency of this method is relatively low, which will affect the system. performance

Images