bellman-ford 中文意思是什麼
bellman-ford
解釋
距離又叫-
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 ，對網路路由演算法的研究提供了很好的支撐環境。
分享友人