摘要
多源多目的地通信是现代通信网络服务中的基本问题之一．该问题可被模拟为找一棵包含特定源和多个目的地的最小代价生成树，使得在一个给定的通信网络中的特定约束被满足．在总结传统方法的优、缺点的基础上，应用神经网络算法对该问题进行了求解．
The Multiple Destination Routing （MDR） problem is one of the fundamental problems in modem communication and network service. It can be simulated as finding a minimal cost tree that contains designed source and multiple destination nods so that certain constraints in a given communication network are satisfied. By comparing advantages and disadvantages of neural network algorithm and the traditional algorithm, this paper uses neural network algorithm to find solutions to the problems.
作者
王会婷
张鹏
WANG Hui-ting, ZHANG Peng （Chongqing University of Science and Technology, Chongqing 400050, China）
出处
《重庆工学院学报》
Journal of Chongqing Institute of Technology
关键词
MDR问题
神经网络算法
数值模拟
Multiple Destination Routing problem
neural network algorithm
numerical simulation
