【24h】

A neural network shortest path algorithm for optimum routing in packet-switched communications networks

机译:分组交换通信网络中用于最优路由的神经网络最短路径算法

获取原文

摘要

The authors consider the application of neural networks to the optimum routing problem in packet-switched communications networks, where the goal is to minimize the network-wide average time delay. Under appropriate assumptions it is shown that the optimum routing algorithm relies heavily on shortest path computations, which have to be carried out in real time. For this purpose an efficient neural network shortest path algorithm based on the Hopfield model is proposed, which is an improved version of previously suggested neural algorithms. The general principles involved in the design of the proposed neural network are discussed. The computational power of the proposed neural model is demonstrated through computer simulations. It is noted that the neural network approach will enable the communications engineer to benefit from the inherent features of neural networks, namely a potential for high computation power and speed, a high degree of robustness and fault tolerance, low power consumption, and real-time operation.
机译:作者考虑了将神经网络应用于分组交换通信网络中的最佳路由问题,其目的是最大程度地减少网络范围内的平均时间延迟。在适当的假设下,可以证明最佳路由算法在很大程度上依赖于最短路径计算,该计算必须实时进行。为此,提出了一种基于Hopfield模型的高效神经网络最短路径算法,它是先前提出的神经算法的改进版本。讨论了所提出的神经网络设计中涉及的一般原理。通过计算机仿真证明了所提出的神经模型的计算能力。需要注意的是,神经网络方法将使通信工程师受益于神经网络的固有特征,即潜在的高计算能力和速度,高度的鲁棒性和容错能力,低功耗和实时性。手术。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号