The shortest path computation in MOSPF protocol using an annealed Hopfieldneural network with a new cooling schedule

Many network services, such as video conferencing and video on demand, have popularly used the multimedia communications. The attached hosts/routers a re required to transmit data as multicasting in most multimedia application s. In order to provide an efficient data routing, routers must provide mult icast capability. In this paper, a new cooling schedule in Hopfield neural network with annealing strategy is proposed to calculate the shortest path (SP) tree for multicast open shortest path first (MOSPF) protocol. The SP t ree in multicast is built on demand and is rooted at the source node. To fa cilitate the hardware implementation, the annealed Hopfield neural network could be a good candidate to deal with SP problems in packet switching comp uter networks. In addition, it is proved that the proposed new cooling sche dule is more suitable in all range of fixed temperature than the other demo nstrated cooling schedules in the experimental results. (C) 2000 Elsevier S cience Inc. All rights reserved.