routing failure 中文意思是什麼
routing failure
解釋
路由失敗-
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 ）時，交叉立方體中任兩個無故障頂點都至少有一條可靠路徑。 -
Then, according to the previous algorithm, we design and implement an mpls multicast rerouting mechanism, which consist of building a bi - direction multicast routing tree backup path, detecting the link failure, notifying the link and recovery. under the environment of mpls - linux, the author also studies traffic - driven mechanism of mpls and pim - sm, and also gives the readers a vista of the future of mpls multicast
本文在mpls - linux環境下，還對以數據流為驅動機制的mpls和組播路由協議pim - sm的結合進行了有益的探索，並且為實現支持組播的lsr的解決方案打下了基礎，並對該論文的未來的工作進行了展望。 -
This makes it very easy to have business processes that seamlessly move from using a service as a task, to managing the service if the task fails, providing either compensation, re - routing, or correction of the failure in automated real - time
這使得很容易就可以獲得業務流程，這些業務流程將服務作為任務來使用，如果任務失敗時，它們會很嚴密地移向管理該服務，並提供補償和流向分配，或者在自動實時地修復改錯誤。 -
Package handling module ( package _ server ) is responsible for assigning all received messages, which can advance real time capability ; communication agent module ( sp _ agent & smc _ agent ) is responsible for communicating with external entities, but does n ' t identify message contents, which can lighten burden of package handling module ; store - and - forward module ( store _ server ) completes store - and - forward mechanism by setting up timer, and implements overtime retransferring and failure handling ; routing module ( route _ server ) is responsible for maintaining the links with the other ismgs to implement routing ; feeing module only consists of some functions which can be called to record message items
其中，業務處理模塊（ package _ server ）負責分派所有收到的外來消息，提高實時性；通信代理模塊（ sp _ agent & smc _ agent ）負責與外界實體通信，不具體識別消息，可減輕業務處理模塊負荷過重的壓力；存儲轉發模塊（ store _ server ）通過設置計時器完成存儲轉發機制，實現超時重傳和失敗處理；路由模塊（ route _ server ）負責維護與其他網關的通信鏈路，實現路由；計費模塊只是一些可供調用的函數，用來完成話單記錄的功能。 -
In order to solve the qos constrained multicast routing in mpls network, including bandwidth, delay, delay jitter, loss rate and cost, we construct a globally optimizing ant algorithm. based on the ant algorithm and qos, we study and develop an algorithm which can repair the multicast routing tree when the network multicast links fail. this algorithm can make traffic rerouting, recover network from failure and improve the ability of resilience
本文探討了在mpls網路中，使用螞蟻演算法解決了包含帶寬、延時、延時抖動、包丟失率和最小網路費用等約束條件在內的服務質量組播路由問題；並且在考慮服務質量的基礎上，研究並設計了在網路出現鏈路故障之後，對組播路由樹進行補救的演算法，使得網路的業務流可以重路由，網路故障得到恢復，提高了網路的恢復力。 -
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 ）相比較，提出的兩種演算法在業務阻塞率、資源利用率以及重路由性能方面都有很好的效果。 -
Failure to comply with shipping, billing, routing, delivery, packing, labeling, or any other instructions or terms of this order, including but not limited to those listed in the next column and on the last page will subject to a chargeback
不符合航運，單據，路線，運輸，包裝，標貼，或此訂單的其它指示或條款，不只限於僅在下欄和最後一頁所列的，將被扣款
分享友人