【24h】

Routing in networks using genetic algorithm

机译:使用遗传算法的网络路由

获取原文
获取原文并翻译 | 示例
       

摘要

With the recent increase in the traffic, internet service providers are forced to seek solutions for better and improved services within the available resources. While the current traffic loads have to be taken into account for computation of paths in routing protocols, network applications require the shortest paths to be used for a speedy communication. The open shortest path first (OSPF) is the routing algorithm used to find the shortest path from source to destination, however, the overloading of the path or link congestion exposes the limitations of OSPF. This shortcoming can be overcome by optimisation of the network through the application of genetic algorithm, as it provides a valuable alternative to the overloaded path between the source and the destination. This paper proposes a distinct method of calculating the shortest path in a network by extending OSPF algorithm with genetic algorithm (OSGA) for achieving the desired improved performance.
机译:随着流量的最近增加,互联网服务提供商被迫寻求在可用资源范围内更好和改善服务的解决方案。尽管在计算路由协议中的路径时必须考虑当前的流量负载,但是网络应用程序需要最短的路径才能进行快速通信。开放式最短路径优先(OSPF)是用于查找从源到目的地的最短路径的路由算法,但是,路径的过载或链路拥塞暴露了OSPF的局限性。可以通过应用遗传算法优化网络来克服此缺点,因为它为源与目的地之间的过载路径提供了有价值的替代方法。本文提出了一种独特的方法,可以通过使用遗传算法(OSGA)扩展OSPF算法来扩展网络中的最短路径,以实现所需的改进性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号