鏈路狀態演算法 的英文怎麼說

中文拼音 [liànlùzhuàngtàiyǎnsuànfǎ]
鏈路狀態演算法 英文
lsa link state algorithm
  • 鏈 : Ⅰ名詞1. （鏈子） chain Ⅱ動詞（用鏈栓住） chain; enchain Ⅲ量詞（計量海洋上距離的長度單位） cable length
  • 路 : 1 （道路） road; way; path 2 （路程） journey; distance 3 （途徑; 門路） way; means 4 （條理） se...
  • 狀 : Ⅰ名詞1 （形狀） form; shape 2 （情況） state; condition; situation; circumstances 3 （陳述事件或...
  • 態 : 名詞1. （形狀; 狀態） form; condition; appearance 2. [物理學] （物質結構的狀態或階段） state 3. [語言學] （一種語法范疇） voice
  • 演 : 動詞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 （標...
  • 鏈路 : chain circuit; periodic line; link; link circuit; path of chain
  • 狀態 : status; state; condition; state of affairs: （病的）危險狀態 critical condition; 戰爭狀態 state o...
  1. Based on the ls alg orithm, the mobile packet routing is implemented using the propagation mode of d bf algorithm and the global routing topology table ( rtt )

    基於鏈路-狀態演算法，採用距離-矢量演算法的傳播方法和全局的路由拓撲表，實現了移動分組無線網的抗毀式路由協議。
  2. The basic thought of the csapfba algorithm is : the edge routers perform the state management per flow, and the edge routers differentiate between the marked flows and the non - marked flows, and the edge routers insert the relevant information into the packet header by using dynamic packet state ; the core routers divide the output link bandwidth into two parts in the light of the state information of the packet header by using class - based queueing, and the core routers allocate proportionally the bandwidth to the marked flows according to their service profiles and the current network load, and the core routers allocate the bandwidth to the non - marked flows according to the principle of max - min fairness, and the csapfba algorithm can adaptively dynamically adjust the bandwidth allocation between the marked flows and the non - marked flows

    本文在csfq演算法的基礎上，提出了一種核心無狀態的自適應的成比例公平帶寬分配csapfba （ core - statelessadaptiveproportionalfairbandwidthallocation ）演算法。 csapfba演算法的基本思想是：在邊界路由器完成基於每個流的狀態處理，將所有的流分成標記流和非標記流兩種類型，採用dps技術將有關信息編碼進分組頭；在核心路由器根據分組頭中攜帶的狀態信息採用cbq策略，將輸出鏈路帶寬分成兩部分，對標記流根據當前的網路負荷按照服務規格成比例地分配帶寬，對非標記流按照最大最小公平性原則分配帶寬，並且能自適應地動態調整帶寬分配的比例。
  3. To analyze some key technologies of optical network relative with rwa in detail, such as transmission, switching and internetworking ; to emphasize on the research of function, fabric and performance of optical cross - connection ; to carry out numerical simulations for crosstalk introduced by optical cross connect and to present measurements for suppressing it such as doubly filtering, fixing optimum decision threshold and appropriately choosing the number of multiplexed wavelengths ; 3. to research the fundamental principle and some problems relative with rwa, including the type of optical network, the type of traffic, the type of service, the survivability of optical network ; to classify and compare rwa algorithms and particularly research some dynamic rwa algorithms ; 4. to present reserved light - path and classify network resource such as used, unused and reserved status, to emulate establishment of all - optical connection in optical network through modified rwa algorithm and show effectively reducing setup time of all - optical connection utilizing reserved light - path ; to research rwa algorithms of multi - fiber network, to present new link weight functions dependent on node degree, unused fiber ( s ) per wavelength - layer and routing policies, to perform emulation of rwa based wavelength layer graph applying new link weight functions and show them make algorithms better performance and network lower blocking rate ; 5

    詳細分析了與rwa相關的光網路關鍵技術，包括傳輸、交換、組網等，重點研究了光交叉連接的功能和結構、性能，對其引入的串擾進行了詳細分析，選擇恰當的器件參數進行了數值模擬，並提出了抑制措施（如雙重濾波、優化判決門限、選擇恰當的復用波長數） ; 3 .研究了光網路的r認叭的基本原理、與r認叭的幾個相關問題（光網路類型、業務類型、流量類型、光網路生存性） 、 r認人演算法的分類和比較，具體研究了幾種動態r場人演算法; 4 .研究了以全光連接建立時間為優化目標的r認認演算法，提出預置光路的概念，對網路資源進行狀態分類（佔用、未佔用、預置） ，利用改進的r認叭演算法模擬，預置光路可為部分新到的連接請求快速建立連接，從而提高網路性能;研究了以多光纖網路連接阻塞率為優化目標的r認城演算法，提出了以節點度數、每個波長分層的空閑光纖數以及路由策略決定的幾種鏈路權重函數，利用基於波長分層圖模型的并行r場人演算法模擬，利用新的鏈路權重函數使得演算法具有更優的性能，使網路具有更低的連接阻塞率。
  4. The dijkstra algorithm of the least of hops is used for path calculated in olsr. but the protocol only tries its best to transmit data, not considering the state of wireless link

    它採用dijkstra演算法計算跳數最短路徑，並盡力而為地傳送數據包，沒有考慮無線鏈路時延、帶寬等狀態和節點擁塞程度，這樣的路徑計算方式已經不能滿足用戶對網路提供服務質量的要求。
  5. Running over tcp, bgp - 4 is a kind of path - vector routing protocol. it has the advantages of distance - vector and link - state routing protocols

    Bgp - 4運行在tcp協議上，在一定程度上綜合了距離向量和鏈路狀態演算法的優點，是一種路徑向量協議。
  6. In l - s algorithm ( link state algorithm ), routing is based on table drove, which can adapt dynamic change of distributed system environment and guarantee message routing correctly

    L - s演算法（即鏈路狀態演算法）採用表驅動的方式進行消息尋徑，能夠自主適應分佈系統環境的動態變化，保障消息的正確尋徑。
  7. The ospf protocol was developed by the ospf working group of the internet engineering task force. it is a dynamic routing protocol based on link - state. ospf is classified as an interior gateway protocol ( igp ), it only processes the routing information in an autonomous system

    Ospf是ietf （ internetengineeringtaskforce ）於1988年提出的一種基於鏈路狀態演算法的動態路由協議，它是用於自治系統內部的內部網關路由協議。
  8. And now it has become the most useful routing protocol in the construction of great network. relatively, the paper discusses the internal mechanism of internet routing particularly and roundly, which involved router mechanism, ip address, routing table, routing framework and the two most familiar routing algorithm - distance - vector and link - state

    本文較細致、全面地討論了internet路由選擇的內部工作機制，包括路由器的工作原理、 ip編址、路由表、 internet路由選擇體系結構，以及兩種主要的路由選擇技術?距離矢量與鏈路狀態演算法。
  9. Design and implementation of query optimizationbased on simulated annealing algorithm

    基於鏈路狀態的多約束路由預計算演算法
  10. A network based approach, called extended petri - nets that represents the design of the supply chain as an abstracted network with " and " and " or " nodes, is presented. based on their substantial disadvantages of linear programming, integer programming, nonlinear programming and genetic algorithm in dealing with a typical supply chain, a constraint based genetic algorithm as part of the extended petri - nets approach is introduced to search for improvements in the design that satisfies the constraints imposed on the system. a prototype testing system is constructed, which is followed by an example together with a description of the small automobile supply chain system implementation

    兩北丁業人學博十學位論義通過對鏈式供需鏈的結構分析，把鏈式供需鏈的設計優化轉化為多階段決策問題，在此基礎上建立了設計優化模型，並提出前向與後向兩種動態規劃求解演算法；鑒于線性規劃、整數規劃、非線牲規劃以及遺傳演算法在解決網狀供需鏈設計優化問題時皆存在著不足，本文對petri網進行了改進，提出了擴展petri網的概念，用於把網狀供需鏈抽象為一個具有「與」和「或」變遷節點的網路，並在前人工作的基礎上，把基於約束的遺傳演算法cbga與擴展petri網結合起來，用
  11. The paper makes research into the multiplayer feedforward networks and dynamic recursive networks, and proposes a method to estimate the speed and rotor flux of induction motors using the dynamic recursive networks. to the used dynamic recursive network model, the off - line dynamic bp algorithm has been reasoned out so as to observe induction motor state variables

    本文分別對多層前向網路和動態遞歸網路進行了研究，提出基於動態遞歸網路的異步電機的轉速估計和磁鏈觀測，針對採用的動態神經網路模型，推導了離線動態bp演算法，以便利用動態遞歸網路進行狀態觀測。
  12. Firstly, this paper deals with two topology exchanging protocols and algorithms for packet radio network, which are based on the troditional link status algorithm and have some changes. secondly, a routing algorithm is presented in this paper, which applys to caculating the best route for unicast and multicast transmission under different routing modes. finally, the paper shows some problems and solvements for network management, and some unsolved problems of this system are also discussed

    首先，本文討論了兩種是在傳統的鏈路狀態法基礎上作了改進而得到的拓撲交換協議與演算法：其次，提出了一種路由演算法，該演算法可用於在多種路由方式下完成單播、多播傳送的最佳路由的計算；最後，討論了網路管理中存在的一些問題和解決方案，並對系統有待解決的問題進行了討論。
  13. This paper analyzed p - persistent csma / cd protocol and proposed a new adaptive algorithm for the adjustment of the coefficient p by real - time channel traffic sensing based on the feedback control theory, i. e., changing the value of p dynamically through the analysis of networks " flow to control the behavior of the stations sending data frames in the same collision domain, to keep the media channel in an optimal state and to enhance the channel transmission efficiency

    該演算法基於對網路流量的分析，在osi物理層通過通道信息量的在線實時檢測，根據反饋控制的原理，在數據鏈路層動態地調整控制輸入參數p ，從而控制站點發送分組數據幀的行為，使通道處于最佳的傳輸狀態，提高通道的效率。
分享友人
分享到 Line

分享到臉書