routing algorithm 中文意思是什麼

routing algorithm 解釋
路徑選擇演算法
  1. Hybrid routing algorithm based on mobile ad hoc network

    網路的一種混合路由演算法
  2. Chaotic neural networks based routing algorithm in atm network

    路由演算法的研究
  3. The paper will study the upper questions based on the two interconnection networks. first, we give a fault - tolerant routing algorithm under the connectivity of the crossed cube in o ( n ) time and the length of the longest routing path ; second, with the rapid progress in vlsi, the failing probability of processors and links is very low, the traditional connectivity underestimates the resilience of large networks / here by applying the concept " conditional connectivity " introduce by harary, we show that the n - crossed cube can tolerate up to 2n - 3 ( n > 2 ) processors failure and remain connected provide that all the neighbors of each processor do not ' fail at the same time, the result is the same as the hypercube. we also give a related algorithm in o ( n ) time, and the length of the longest path ; third, we apply cluster faun tolerance introduced by q. - p

    根據menger定理， n -維交叉立方體可以容納n - 1個故障頂點，我們給出了它的時間復雜度為o （ n ）的容錯路由選擇演算法及其最長路徑長度分析；在此基礎上本文證明， n -維交叉立方體的條件連通度為2n - 2 （ n 2 ） ，並給出了相應時間復雜度為o （ n ）的演算法及其最長路徑長度；除此之外，本文還證明當n -維交叉立方體中的故障簇個數不大於n - 1 ，其直徑不大於1 ，故障頂點總數不超過2n - 3 （ n 2 ）時，交叉立方體中任兩個無故障頂點都至少有一條可靠路徑。
  4. Tabu - hierarchy genetic qos multicast routing algorithm in ngi

    組播路由演算法
  5. Power - saving routing algorithm based on ant algorithm in ad hoc networks

    一種基於螞蟻演算法的移動自組網節能路由演算法
  6. Dynamic qos multicast routing algorithm based on ant colony system

    多播路由演算法
  7. A qos multicast routing algorithm based on ant colony algorithm

    多播路由演算法
  8. A multicast routing algorithm based on delay and bandwidth constrains

    組播路由演算法
  9. Compared grid routing and gridless routing, an efficient and fast gridless line - search routing algorithm - target - oriented line search routing method for automatic circuit layout - is proposed

    通過比較有網格自動布線和無網格自動布線的優缺點，本文確定採用一種高效快速的無網格線探索布線演算法?朝向目標的線探索法。
  10. The deadlock - free behavioral routing algorithm on star graph

    星形圖上無死鎖的路徑演算法
  11. We study one of the key point in interconnection network, theory of deadlock - free. we focus on the wormhole switching deadlock - free theory in interconnection network, and a new design method based on hybrid switching is proposed, which provides a fine way to realize deadlock - free routing algorithm

    重點對採用蟲孔路由的直接網路無死鎖問題進行了研究，在深入分析大量已有演算法和無死鎖理論的基礎上，設計混合切換技術下的無死鎖路由演算法，給出了無死鎖路由設計的一個可行途徑。
  12. We study the design of routing algorithm. after analyzing the characteristics of message routing in the interconnection network, one new concept " the best network for routing " ( bnr ) is proposed. base on it, we present the framework for designing high performance minimal deadlock - free fully adaptive routing algorithms

    基於「最佳尋徑網」框架，以低通信延遲、高通信帶寬和易vlsi實現為目標，設計了自適應性強、可擴展性好、性能優越的bbfam （ bnr - basedfully - adaptivealgorithmonmesh ）完全自適應路由演算法。
  13. So flexibility could be achieved, because when the routing algorithm changes, there is no need to redesign the group communication layer

    這樣可以使系統有很好的適用性，使得網路層的路由策略改變時組通信層可以不做任何修改。
  14. Based on these graphic models an efficient routing algorithm, called ieacs ( intensified evolutionary ant colony system ) algorithm is suggested. ieacs merges the acs ( ant colony system ) and ga ( genetic algorithm ), thus features both the mechanism of cooperative learning of acs and the information - exchange capability of ga, is presented in this thesis. in case of asymmetric grid graph and grid - off graph

    然後，介紹了一種兼具生物仿生特性的蟻群和遺傳演算法特點的進化蟻群演算法，並對該演算法模仿蟻群的協同學習機制，以及遺傳演算法的優秀群體中的個體之間信息交換的策略進行了闡述，接著探討了該演算法在總體布線和斯坦納樹問題中的應用。
  15. The second part introduces concepts and knowledge of the integrate circuit ( ic ) design and package. the third part introduces the realization of the routing algorithm and the

    （ 2 ）包括第二、三章，介紹了集成電路設計和封裝的概念和知識。
  16. Delay - constrained least - cost routing algorithm

    時延約束的最小費用路由選擇演算法
  17. What flow is that, we use model simulation to analyze the em algorithm contraction ratio. through network simulating, we analyze the factors which can influence loss inference algorithm accuracy like measurement strategy or routing algorithm. we analyze the accuracy and contraction characteristic of multicast - based direct algorithm and em algorithm, and compare the error factor between them

    實驗中通過網路模擬模型，確定了em演算法的收斂速率;研究了不同測量策略和路由器擁塞避免演算法對丟包率推理演算法準確率的影響;分析了單點多播的de和em演算法準確性、收斂性等特徵，通過比較兩種演算法的統計誤差，得出em演算法略優于de演算法的結論。
  18. A fast routing algorithm for delay - constrained low - cost multicast

    約束的多播多路徑算販
  19. Based on this extended model, we then propose an oblivious algorithm that can route messages between any two nodes in o expected number of hops. our routing algorithm keeps only o beta 1 bits of information on each node, where 1

    Kleinberg證明了如果每個節點只用local的路由信息，簡單的貪婪演算法可以在o lg n 2的期望時間內完成任何兩點間的路由過程。
  20. A delay - constrained multicast routing algorithm based on shared tree

    一種時延受限共享組播樹演算法
分享友人
分享到 Line

分享到臉書