bellman-ford meaning in English

距离又叫
又叫

Unfortunately , the problem of finding multicast routing with qos constrained is a np - complete problem . so we can not solve the problem with the classical shortest path first algorithms such as bellman - ford and dijstra
然而研究表明，由于qos组播路由带有多个qos约束参数，因此qos组播路由问题是一个np完全问题，这使得它与传统的路由过程不同，难以用经典的最短路径优先算法求解。
The thesis then studies the emulation modes of routing algorithms with inaccurate network state information , proposes a simulation model based on events for routing algorithms with inaccurate network state information , and develops a routing simulation software r - ns that provides an effective environment for the research of network routing algorithms . randomized routing algorithms based on improved dijkstra and bellman - ford algorithms are proposed for the unicast routing model with inaccurate network state information
本文研究了非精确网络状态信息的路由算法模拟仿真方法，提出了非精确网络状态信息下基于事件的网络路由模拟仿真模型，设计并实现了路由模拟仿真软件rns ，对网络路由算法的研究提供了很好的支撑环境。