free routing 中文意思是什麼
free routing
解釋
自由路徑選擇-
The deadlock - free behavioral routing algorithm on star graph
星形圖上無死鎖的路徑演算法 -
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
重點對採用蟲孔路由的直接網路無死鎖問題進行了研究，在深入分析大量已有演算法和無死鎖理論的基礎上，設計混合切換技術下的無死鎖路由演算法，給出了無死鎖路由設計的一個可行途徑。 -
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 ）完全自適應路由演算法。 -
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的情況。 -
To analyze the factors of impacting load balancing of links, which is including the number of routes between source node and destination node, the number of routes through every link, the maximum flow between source node and destination node, the maximum flow through every link, the free bandwidth of every link and so on, we present the fast dynamic routing algorithm ( fdra ) and the critical link routing algorithm ( clra ). simulation results show presented algorithms in the paper are better than other algorithms in reject ratio of the traffic requests and performance of rerouting the traffic requests when a link is failure, especially in computing time cost
通過分析影響網路的鏈路負載均衡的因素，比如源-目的節點間的最大流，通過每條鏈路的最大流，源-目的節點間的路徑數目，通過每條鏈路的路徑數目，以及鏈路的剩餘容量等，提出了快捷動態路由演算法fdra和關鍵性鏈路路由演算法clra ，通過模擬，與最小跳演算法（ mha ） 、最寬最短路徑（ wsp ）演算法、最小干擾路由演算法（ mira ）相比較，提出的兩種演算法在業務阻塞率、資源利用率以及重路由性能方面都有很好的效果。 -
However, i have recently received complaints alleging that the police had time and again prosecuted the residents bus operators at tin shui wai for breaching the stipulations on the routing prescribed by the transport department ( " td " ) and slightly breaching the requirement on the frequency and time of the services but they had not instituted prosecutions against the persons concerned in relation to the free shuttle bus services and the residents bus services provided by the operators of kingswood ginza and harbour plaza resort city respectively in the same district, which have been operating without the approval of the td
然而，本人最近仍接獲投訴，指天水圍屋?巴士的經營者因違反運輸署規定的行駛路線及稍微違反規定的班次時間而多次被警方檢控；但在同區由嘉湖銀座廣場經營者提供的免費穿梭巴士服務以及嘉湖海逸酒店經營者提供的屋?巴士服務，雖然沒有獲得運輸署批準，至今仍在運作，而警方亦沒有對有關人士提出檢控。 -
The processors overlapping along the boundaries of different fault regions is allowed. the proposed algorithm, which routes the messages by x - y routing algorithm in fault - free region, can tolerate convex fault - connected regions with only two virtual channels per physical channel, and is deadlock - and livelock - free. the proposed algorithm can be easily extended to adaptive routing
本文的主要貢獻是提出了一套基於真值表的形式化的故障區域邊界的配置方法，每一個節點只需要知道它的八鄰接節點是正常節點或故障節點就可以配置故障區域的邊界，路由信息能應用該邊界繞道故障區域。 -
The paper proved under these condition, the fault tolerance of the network is improved remarkably. more, if under the fault - tolerant systems, how to find a free path from any two free processors ? that related to fault tolerant routing which is also hot recently
當互連網路中故障處理器數不大於其容錯度時，即保證網路中任兩個處理器間都有至少一條可靠路徑時，如何高效地在兩個無故障處理器間找到一條盡可能短的無故障路徑，即為互連網路的容錯路由選擇問題。 -
Last we propose a dynamic routing and wavelength assignment algorithm utilizing the model of free wavelength based wavelength conversion degree
最後基於波長轉換度的空閑波長圖模型，提出了一種用於wdm光網路在備選路由下的動態rwa的改進演算法。 -
A novel distributed loop - free routing algorithm in the ad hoc networks
網路中分散式無環路由演算法設計
分享友人