路由演算法 的英文怎麼說

中文拼音 [lùyóuyǎnsuànfǎ]
路由演算法 英文
algorithm, routing
  • 路 : 1 （道路） road; way; path 2 （路程） journey; distance 3 （途徑; 門路） way; means 4 （條理） se...
  • 由 : causereason
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  1. Hybrid routing algorithm based on mobile ad hoc network

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

    路由演算法的研究
  3. Tabu - hierarchy genetic qos multicast routing algorithm in ngi

    組播路由演算法
  4. Its arithmetic just based on hops counting is low efficiency and unilateralism when the network have complex link state

    面對現實網路系統中各種復雜的鏈路形態，僅僅基於躍點計數的路由演算法是低效和片面的。
  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. Ns - 2 simulation of routing and wavelength assignment algorithm in wdm network

    波長路由演算法的模擬
  9. A multicast routing algorithm based on delay and bandwidth constrains

    組播路由演算法
  10. 1 milgram s. the small world problem. psychology today, 1967, 61 : 60 - 67. 2 albert r, jeong h, barabasi a l. the diameter of the world wide web

    據本文作者所知，目前最好的基於small world網路的路由演算法只能達到o lg n 1 1 d的時間復雜度。
  11. 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 ，對網路路由演算法的研究提供了很好的支撐環境。
  12. We discuss the formation of the unidirectional links and their influence on the manet routing protocols such as dsr, dsdv, aodv. solutions are given to overcom e the problems, we analyze some of they and point out their limitations. in the third part, we show a new on - demand routing strategy supported unidirectional links, it use the two circuits route search algorithms to establish the route from the source node to the destination and backward with directions ; it transfer the route error messages from the backward positions to the forward positions one by one ; it apply the packet encapsulation technique to forward the packets through the unidirectional links and introduced the circuit path to transmit information from the forward node to the backward node

    接著，指出在移動自組網環境中，單向鏈路的普遍存在，分析了它的產生原因、它對目前協議棧的影響；然後，我們給出了一種按需路由的自組網單向鏈路路由演算法，它只有在需要路徑的時候才維護路由，使用二循環路由尋徑演算法以建立節點間的路徑，使用逐跳逆向傳遞的方式報告路由終斷，使用封裝廣播的方式沿單向鏈路正向傳輸，使用報文封裝方式支持單向鏈路下游節點向上游節點傳遞信息。
  13. 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

    重點對採用蟲孔路由的直接網路無死鎖問題進行了研究，在深入分析大量已有演算法和無死鎖理論的基礎上，設計混合切換技術下的無死鎖路由演算法，給出了無死鎖路由設計的一個可行途徑。
  14. 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 ）完全自適應路由演算法。
  15. In wormhole meshes, a reliable routing is supposed to be deadlock - free and fault - tolerant. many routing algorithms are able to tolerate a large number of faults enclosed by rectangular blocks or special convex, none of them, however, is capable of handling two convex fault regions with distance two by using only two virtual networks

    在應用蟲孔路由的mesh結構的多處理機系統中，已經有許多基於維數序的容錯的路由演算法被提出，其中大多數路由演算法只能容忍矩型或凸型的故障節點組成的區域，但是，至今還沒有一個演算法能應用兩個虛擬通道處理凸型convex故障區域距離大於和等於2的情況。
  16. Combining the international newest research result of multicast tree, this paper get a series of high efficiency arithmetic of multicast tree problem with the method of increasing storage space, and this paper also takes into account the dynamic capability of arithmetic. in many research fields of multicast tree, many high - efficiency solutions were obtained in this paper. this paper has broadly discussed about multicast tree problem and obtained dmdt ( dynamic minimum distance tree ), fmph ( fast minimum path cost heuristic ), dmph ( dynamic minimum path cost heuristic ) and fgmra ( fast group multicast routing arithmetic )

    本篇論文對多播生成樹問題進行了比較全面的討論，涉及內容包括單約束的單樹多播、單約束的成組多播等多個方面，所提出的動態最短路徑樹演算法dmdt （ dynamicminimumdistancetree ） ，最小代價多播生成樹演算法fmph （ fastminimumpathcostheuristic ）動態最小代價多播生成樹演算法dmph （ dynamicminimumpathcostheuristic ） ，成組多播快速路由演算法fgmra （ fastgroupmulticastroutingarithmetic ） ，都取得了顯著的效果，是目前同類問題中比較好的解決方案，達到了預期的目的。
  17. A delay - constrained many - to - many multicast routing heuristic algorithm

    一個快速的時延有界低代價多播路由演算法
  18. A delay - constrained dynamic algorithm for multicast routing

    一個時延約束的動態組播路由演算法
  19. The time complexity is low because only shortest paths connected to relay nodes is compared. simulation results show that fairly good cost performance is achieved. there is trade - off between complexity and performance

    由於比較了通過中轉節點后的最短路徑，因此運算的復雜度大大降低，且通過模擬得到了較好的性能，模擬結果表明sp - dvma演算法是一種低復雜度的時延和時延差約束的多播路由演算法。
  20. Extensive experimental simulations are performed based on the above proposed algorithms and the considered routing models. the simulation results show that our algorithms effectively get higher request acceptance ratio and more balanced network load, and improve the availability of network resource

    通過模擬測試表明，我們所提出的演算法比以前所提出的關于相關問題的qos路由演算法具有更高的請求接受率，並更加有效地均衡了網路負載，提高了網路資源利用率。
分享友人
分享到 Line

分享到臉書