路徑負載 的英文怎麼說

中文拼音 [lùjìngfùzǎi]
路徑負載 英文
poh path overhead
  • 路 : 1 （道路） road; way; path 2 （路程） journey; distance 3 （途徑; 門路） way; means 4 （條理） se...
  • 徑 : Ⅰ名詞1 （狹窄的道路; 小路） footpath; path; track 2 （達到目的的方法） way; means 3 （直徑的簡稱...
  • 負 : Ⅰ名詞1 （負擔） burden; load 2 （虧損） loss 3 （失敗） defeat Ⅱ動詞1 [書面語] （背） carry on th...
  • 載 : 載Ⅰ名詞（年） year : 一年半載 six to twelve months; six months to a year; 三年五載 three to five ...
  • 路徑 : 1. （道路） way; route; trajectory; path; tail; travel2. （門路） method; ways and means
  • 負載 : [電學] load
  1. Finding a feasible and efficient load balanced strategy for the ultra - scalable multi - plane multi - stage switch architecture is a top of nowadays research. the dissertation proposes a two - stage load balanced scheme for the ultra - scalable multi - plane multi - stage switch architecture based self - routing and non - blocking permutation benes network. the approach uses reasonable and efficient logical queueing strategy and schedule scheme in ingress traffic managers and switch planes to realize the two - stage load balancing of ip traffic which for different destination addresses

    本文提出一種適用於基於完全可重排無阻塞benes拓撲構建的多平面多路徑（多級）超大容量交換結構的兩級負載均衡策略，通過在輸入流量管理器和benes交換平面內部實施合理而高效的隊列組織調度方法，有效實現了基於不同目的地址的ip流量在兩個層次上的負載均衡，較好彌補了ciscocrs - 1系統在平面選擇和中間級選擇時所採用的簡單隨機或輪循方案的不足。
  2. In the leach - new protocol, the mainly improvement of the leach protocol exhibits as follow : for the sake of balancing the network load, the network choose the clusters based on the residual energy ; we take multi - hop communication between sensors instead of single - hop communication, which results in the reduction of energy consumption of clusters ; the new protocol finds the path to the cluster head with the minimum cost, using an algorithm similar to flooding to propagate the cost information and greedy algorithm to find the lowest cost link ; the algorithm for assigning tdma time slot reduces overall delays of network

    在leach - new協議中，對leach協議的改進主要體現在以下幾個方面:根據節點剩餘能量選擇簇頭，以平衡網路負載;節點間採用多跳路由，降低簇頭能量消耗;節點根據能量消耗的代價來選擇至簇頭的路由，通過擴散演算法來廣播代價消息，採用貪婪演算法來選擇能量消耗最小的路徑;採用tdma時隙分配演算法減少網路時延。最後，利用ns2模擬軟體進行驗證。
  3. Simulated results showed that the proposed algorithm is available to construct effectively and quickly, the multicast tree satisfying delay constraint and lowest link cost, with network load balance taken into account to pick out the cheaper idle route

    模擬結果表明，該演算法在考慮網路的負載均衡情況下，選擇鏈路代價較低的空閑路徑，快速、有效地構建滿足時延要求，鏈路代價最小的組播樹。
  4. Summaries are made concerning the typical network optimization problem. the paper independently puts forward several optimal methods to improve network traffic transmission, such as the maximum - flow problem over mpls, including the arc - based and path - based solution, which adopt the method of splitting and unsplitting traffic, the solution to the greatest reliability of transmission, the solution to concurrent maximum - flow for load balance via linear programming. on the basis of mpls path protection several protection methods over mpls are proposed, including n - to - 1, n - to - m protection solution in splitting and unsplitting cases and in diffserv cases, whose partial simulation results are provided as well

    即： 1 ） mpls網路最大流傳輸問題，包括基於弧的最大流解決方案、基於路徑的最大流解決方案，分流與不分流的最大流處理方法以及多源多匯最大流解決方案； 2 ）最大可靠性傳輸問摘要博士論文題: 3 ）基於弧的求解流量負載平衡問題的線性規劃方法; 4 ）基於路徑的流量負載平衡方法以及其他負載均衡問題; 5 ）在mpls路徑保護的思想和方法的基礎上，提出了基於mpls的若干新的路徑保護方法，即n一t 。
  5. The multipath olsr protocol will calculate all of possible paths from the source node to destination node. then, it should select one of paths with less congestion nodes for the second path. the paper has designed an effective algorithm of load assigned, to avoid overwhelming some central nodes in the network

    多路徑將選擇一條擁塞程度更輕的路徑作為備用路徑，這樣可以減輕中間部分擁塞節點的處理負擔，將網路負載分配到全網所有節點，即達到負載均衡的效果;二是為了提供qos業務而改進的olsr約束路由協議。
  6. By synthetically considering all kinds of attributes of network resources and traffic flows, and introducing the distinguishing function and counting out the transfer - value of the paths, the algorithm will confirm whether the traffic flow is fit to transfer to the new path in order to balance the network load and enhance the utilization ratio of network resources

    該演算法對網路資源屬性和業務流屬性加以綜合考慮，引入判別函數並由此計算出路徑的遷移值，從而確定業務流是否適于遷移，以最終達到均衡網路負載，提高網路資源利用率的目的。
  7. Avm is essentially a precision array film attenuator, which has a big diameter, high power load, continuous adjustment. the gain of each beam of the main amplifiers is controlled independently by the adjusting the angle of each cell of avm

    Avm實質上是大口徑、高功率負載、透過率連續可調的組合式精密薄膜衰減器，通過調節avm各單元偏轉角度大小來獨立控制住放大器各路的增益。
  8. 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 ）相比較，提出的兩種演算法在業務阻塞率、資源利用率以及重路由性能方面都有很好的效果。
  9. Our simulation shows that the path will not be improved obviously with the further increase of k, when it reaches a certain value. in addition to this, the dissertation shows that when rh = 3 and rh = 4, the results are similar. 2. in regard to the application layer routing of tree - based p2p multicast, the dissertation presents a new kind model of spanning tree, named dcmd, in which the path delay, the

    2 .在基於樹的p2p組通訊的傳輸路徑方面，抽象了一個新的生成樹問題? ? dcmd問題，該問題同時考慮了線路延遲、主機的發送/轉發延遲和每個主機的工作負載有限三種情況，可以更加全面地刻畫出構建在應用層的p2p組通訊;證明了這個問題屬于np - hard ;提出了基於最大度和基於最長路徑兩類啟發式演算法作為解決該問題的途徑。
  10. For optical - layering approach, we propose an ant - based algorithm, which uses the ants " capability of finding shortest or near - shortest paths between a food source and their nests, to solve the logical topology reconfiguration problem. we give the ants routing formula based on dynamic load balancing and short path on the assumption that some conditions hold

    前者適合於業務矩陣變化不是太頻繁的網路，提出利用螞蟻演算法解決業務的再路由問題，即利用螞蟻具有找到最短徑及不同種類螞蟻具有互斥的天然特性來進行邏輯拓撲重配置，從而保證了鏈路負載分佈的平衡性。
  11. Meanwhile, to further solve the load balancing problem of manets, aolr introduced several mechanisms, such as the admission control mechanism, backward congestion restrain mechanism, shortcut enforcement mechanism, and the noise - encouraged route - selection mechanism, in order to dynamically perceive the load of nodes and increase the adaptability to it

    同時，為了進一步的解決自組網中的負載均衡問題，在aolr中引入了準入控制規則、擁塞反向抑制規則、捷徑增強規則以及噪聲選路規則，通過對節點負載狀態的動態感知增加節點對負載的動態適應能力。
  12. An improved load distribution over multi - path algorithm with proportional routing

    一種改進的多路徑負載分配均衡演算法
  13. Basing on the study of the current routing algorithm, it proposes a new sd - anycast routing protocol algorithm. according to the character of this protocol, it implements this new protocol by adding additional packet header, routing maintaining and node dealing modules. lastly, according to creating prototype system and designing four comparing experiments, it gets the experiment statistical data, and makes a conclusion that this routing protocol algorithm has a better performance on one way delay, output, load balance and etc

    本文首先介紹了anycast服務的概念、特點以及研究現狀;在分析了路由協議的一些相關知識和當今anycast路由協議的研究現狀的基礎上，深入研究了當前的路由協議演算法，提出了一個sd - anycast協議演算法，並在網路模擬軟體ns2設計平臺中根據該協議的特點，通過設計數據包報頭、路由表維護和節點處理等功能模塊，實現了該協議演算法;最後通過建立原型系統並設計四個對比實驗，得出實驗統計數據，定量地測定了該路由協議演算法在單程路徑延遲、吞吐量和負載平衡等方面所具有的優越性。
  14. Thirdly, we study how to use the genetic algorithm solve the multi - objective optimization singlecast qos routing algorithm. the simulation result shows that the method can find singlecast route quickly and effectively. it also shows that the model can provide different service to different rank network data, balance the network load and reduce the network congestion effectively

    第三，研究了如何利用遺傳演算法來求解多目標最優化單播qos路由，模擬實驗驗證了演算法能夠快速有效地找到路徑，並能為不同等級的數據提供不同質量的傳輸服務，有效地提高了網路資源利用率，平衡了網路負載，減少了網路擁塞。
  15. This paper presents a new group route algorithm based on ad hoc network, which partitions the nodes to some groups, broadcasts the request of route to different groups, consequently finds out an near optimized path rapidly. the algorithm lightens the load on network, and lays a foundation for mobile database communication

    本文提出了adhoc網路中一種新的分組路由策略，該策略將以節點分組為基礎，使路由請求在組之間廣播，從而快速有效地找出近優的路徑，減輕網路負載，為移動數據庫的通信提供了基礎。
  16. Taking account of the bottleneck - path which results in the congestion of network and analyzing the reason of unbalanced load with the link cost redefined, a genetic algorithm is presented to solve the problem of multicast routing

    摘要針對網路的瓶頸路徑易造成網路擁塞的現象，分析了鏈路負載不平衡的原因，重新給出鏈路代價定義，提出一種遺傳演算法求解該類組播路由問題。
  17. Interval routing scheme was introduced to reduce the size of routing tables, multi - dimensional routing scheme is the extension of interval routing scheme and it can represent all shortest paths between each pair of nodes, which turns out to be convenient when problems related to flow control aspects such as fault tolerance and traffic load balancing are considered

    區間路由方法是使用簡明路由表的一種路由方案，多維區間路由方法是區間路由方法的擴充，它能夠表示網路中每兩個結點之間所有的最短路徑。當我們需要考慮容錯、通信與計算量的負載平衡問題時，這將是很有用的。
  18. But in the process they have also lost a degree of control. in circuit - switched environments network managers always knew exactly what paths, or routes, their network traffic would take - because they set up those fixed paths themselves

    在電路交換的環境中，網路管理人員總是很準確地知道其網路話務將由哪一條路徑或哪一條路由負載，因為這些固定的路徑是由他們自己建立的。
分享友人
分享到 Line

分享到臉書