The Application of K–Shortest Path Algorithm in Multicast Routing


Abstract. There have been many heuristic algorithms finding multicast trees proposed over the past few years. The necessity for finding a better and more suitable algorithm is still a current and important challenge. The article presents a new multicast routing algorithm for finding a multicast tree in packet networks. The objective of the K-Shortest Path… (More)


5 Figures and Tables

Slides referencing similar topics