TY - JOUR

T1 - Using neural networks to solve the multicast routing problem in packet radio networks.

AU - Hemminger, T. L.

AU - Pomalaza-Raez, C. A.

PY - 1996/11

Y1 - 1996/11

N2 - The primary function of a packet radio network is the efficient transfer of information between source and destination nodes using minimal bandwidth and end-to-end delay. Many researchers have investigated the problem of minimizing the end-to-end delay from a single source to a single destination for a variety of networks; however, very little work is reported about routing mechanisms for the common case where a particular information packet is intended to be sent to more than one destination in the network. This is known as multicasting. A simplified version of the problem is to ignore the packet delay at each node, then the problem becomes one of finding solutions which require the least number of transmissions. Determination of an optimal solution is NP-complete meaning that suboptimal solutions are frequently tolerated. The problem becomes more rigorous if packet delays are included in the network topology. This paper describes a practical technique for the computation of optimum or near optimum solutions to the multicasting problem with and without packet delay. The method is based on the Hopfield neural network and experiment has shown this method to yield near optimal solutions while requiring a minimum of CPU time.

AB - The primary function of a packet radio network is the efficient transfer of information between source and destination nodes using minimal bandwidth and end-to-end delay. Many researchers have investigated the problem of minimizing the end-to-end delay from a single source to a single destination for a variety of networks; however, very little work is reported about routing mechanisms for the common case where a particular information packet is intended to be sent to more than one destination in the network. This is known as multicasting. A simplified version of the problem is to ignore the packet delay at each node, then the problem becomes one of finding solutions which require the least number of transmissions. Determination of an optimal solution is NP-complete meaning that suboptimal solutions are frequently tolerated. The problem becomes more rigorous if packet delays are included in the network topology. This paper describes a practical technique for the computation of optimum or near optimum solutions to the multicasting problem with and without packet delay. The method is based on the Hopfield neural network and experiment has shown this method to yield near optimal solutions while requiring a minimum of CPU time.

UR - http://www.scopus.com/inward/record.url?scp=0030279267&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030279267&partnerID=8YFLogxK

U2 - 10.1142/S0129065796000609

DO - 10.1142/S0129065796000609

M3 - Article

C2 - 9040063

AN - SCOPUS:0030279267

VL - 7

SP - 617

EP - 626

JO - International Journal of Neural Systems

JF - International Journal of Neural Systems

SN - 0129-0657

IS - 5

ER -