random routing 中文意思是什麼
random routing
解釋
隨機路徑選擇-
Random routing has the capability of handling random transmission errors efficiently with high forwarding speed
隨機路由可以有效地處理傳輸過程中的隨機錯誤，並具有較高的轉發速度。 -
Abstract : an efficient parallel global router using random optimization that is independent of net ordering is roposed. parallel approaches are described and strategies guaranteeing the routing quality are discussed. the wire length model is implemented on multiprocessor, which enables the algorithm to approach feasibility of large - scale problems. timing - driven model on multiprocessor and wire length model on distributed processors are also presented. the parallel algorithm greatly reduces the run - time of routing. the experimental results show good speedups with no degradation of the routing quality
文摘:設計實現了一個高效的線長模式下基於多處理機的并行總體布線器.通過對非時延驅動模式下串、并行演算法的總運行時間和求解時間的比較，表明該并行演算法能夠在保證求解質量無明顯變化的前提下大大加快總體布線演算法的求解速度.同時，也提出了基於分散式體系結構的并行總體布線演算法 -
This paper proposes a random routing algorithm with end - to - end feedback
摘要提出一種帶有端到端反饋的隨機路由演算法。 -
11 bollob as b, chung f r k. the diameter of a cycle plus a random matching. siam journal on discrete mathematics, 1988, 1 : 328 - 333. 12 barri ere l, fraigniaud p, kranakis e, krizanc d. efficient routing in networks with long range contacts
在本文演算法中，每個節點在作出路由決策之前，先探索一定距離的augmented local neighborhood ，並且從其中選出一個滿足一定條件的節點作為中轉點，然後把message送到離中轉點最近的下一個節點。 -
Experimental results demonstrated that our random routing algorithm has lower latency, lower power consumption, and can provide on - chip communication with high reliability
實驗結果表明，該演算法具有較短的延遲，較低的功耗，並能提供高可靠的片上通信。 -
In the thesis, the key technical problems utilizing genetic algorithm and random method to design any - cast routing algorithms are explored. we designed and realized the any - cast routing algorithm based on genetic algorithm. resolved the problems concerned in the algorithms, such as the code model, the original genus selection, the fitness function, the crossover strategy, the mutation regulation, and the algorithm ' s convergence, avoidance of dead loop etc. aim at different network scales we propose two any - cast routing algorithms
論文探討利用遺傳演算法和隨機方法研究選播路由演算法的關鍵技術問題，設計實現了基於遺傳演算法的選播路由演算法，解決了演算法中的編碼模式、初始種群選擇、適應度函數、交叉策略、變異規則，以及演算法的收斂、路由死循環的避免和負載均衡等問題。 -
We present an approximate universal analytical technique ( e - rla ), based on link independent assumption and rla approach, for the blocking performance analysis of all - optical networks with partial wavelength conversion, fixed routing and random wavelength assignment. the proposed technique can be applied to arbitrary networks with arbitrary wavelength conversion configuration and arbitrary traffic mode
我們基於鏈路獨立性假設和rla技術提出了部分波長轉換配置方式下波長路由光網路的阻塞性能的通用近似分析方法（ e - rla ） ，該方法擴展了rla的適用范圍，可以適用於任何網路拓撲、任何業務量分佈模式條件下網路中任意鏈路上配置任意數目轉換器情況的研究。
分享友人