论文部分内容阅读
Overlay multicast has become one of the most promising multicast solutions for IP network,and Neutral Network(NN) has been a good candidate for searching optimal solutions to the constrained shortest routing path in virtue of its powerful capacity for parallel computation. Though traditional Hopfield NN can tackle the optimization problem,it is incapable of dealing with large scale networks due to the large number of neurons. In this paper,a neural network for overlay multicast tree com-putation is presented to reliably implement routing algorithm in real time. The neural network is constructed as a two-layer recurrent architecture,which is comprised of Independent Variable Neurons(IDVN) and Dependent Variable Neurons(DVN) ,according to the independence of the decision variables associated with the edges in directed graph. Compared with the heuristic routing algorithms,it is characterized as shorter computational time,fewer neurons,and better precision.
Overlay multicast has become one of the most promising multicast solutions for IP network, and Neutral Network (NN) has been a good candidate for searching optimal solutions to the constrained shortest routing path in virtue of its powerful capacity for parallel computation. Though traditional Hopfield NN can tackle the optimization problem, it is incapable of dealing with large scale networks due to the large number of neurons. In this paper, a neural network for overlay multicast tree com-putation is presented to reliably implement routing algorithm in real time. The neural Compared with the decision variable associated with the edges in directed graph. Compared to the heuristic routing (IDNN) and Dependent Variable Neurons (DVN) algorithms, it is characterized as shorter computational time, fewer neurons, and better precision.