Neural Network based Dynamic Multicast Routing
Keywords:Dynamic routing, multicast, Steiner tree problem, Hopfield neural network
AbstractThe Hopfield neural network is suggested for dynamic multicast routing in communication network of arbitrary topology and under variable traffic conditions. A new algorithm takes into account not only the most important parameters describing the actual network state (the network topology, link and router bandwidths, estimated link delays, and the traffic density), but also the history of link/router occupancy. The goal of the paper is to find the Pareto optimal path for multicast routing case and to avoid possible packets loss, due to heavy traffic. The effectiveness of the new routing algorithm has been verified under various network topologies and traffic conditions.
How to Cite
Authors retain copyright and grant the journal the right of the first publication with the paper simultaneously licensed under the Creative Commons Attribution 4.0 (CC BY 4.0) licence.
Authors are allowed to enter into separate, additional contractual arrangements for the non-exclusive distribution of the paper published in the journal with an acknowledgement of the initial publication in the journal.
Copyright terms are indicated in the Republic of Lithuania Law on Copyright and Related Rights, Articles 4-37.