網路阻塞概率 的英文怎麼說

中文拼音 [wǎnglùzǔsègàilǜ]
網路阻塞概率 英文
network blocking probability
  • 網 : Ⅰ名詞1 （捕魚捉鳥的器具） net 2 （像網的東西） thing which looks like a net 3 （像網一樣的組織或...
  • 路 : 1 （道路） road; way; path 2 （路程） journey; distance 3 （途徑; 門路） way; means 4 （條理） se...
  • 阻 : 動詞（阻擋; 阻礙） block; hinder; impede; obstruct
  • 概 : Ⅰ名詞1 （大略） general outline 2 （神氣） manner of carrying and conducting oneself; deportment ...
  • 率 : 率名詞（比值） rate; ratio; proportion
  • 網路 : 1. [電學] network; electric network2. （網） meshwork; system; graph （指一維復形）; mesh
  • 阻塞 : choke; block; clog; stop; obstruct; jam; barrage; blockage; blocking; [醫學] obstruction; choking...
  • 概率 : [數學] probability; chance概率論 probability theory; theory of chances; 概率曲線 probability curv...
  1. 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場人演算法模擬，利用新的鏈路權重函數使得演算法具有更優的性能，使網路具有更低的連接阻塞率。
  2. Next, a novel priority - based wavelength assignment algorithm in all - optical networks with partial wavelength conversion is proposed, based on link independent assumption and the method of calculating the network the blocks probability. it improves the routing and wavelength assignment presented by others. this algorithm fits the demand of different business for asking the grade of corresponding different services in the modern all - optical network than the original algorithm

    其次研究了部分波長可變wdm網中支持優先級的波長分配問題，以及在此網路中網路阻塞概率的計算;基於鏈路波長佔用獨立性假設，改進了在部分波長轉換wdm網中已有的rwa演算法，提出了一種支持優先級的動態波長分配演算法，該演算法保證了較高優先級的光路建立請求具有較低的阻塞率，比原有演算法更加適合現代光網路中不同業務請求對應不同服務等級的要求。
  3. Whereafter, this thesis describes the relationship between the block probability and erlang capacity, and analyses the erlang capacity using two different methods. this thesis discusses the factors which effect the erlang capacity of system. the erlang capacitis are given under every conditions to direct cdma network planning

    隨後分析了阻塞概率和愛爾蘭容量的關系，並用兩種不同的方法（理論分析和蒙特卡羅模擬）對cdma系統的愛爾蘭容量進行了詳細地分析，討論了各參數對系統的愛爾蘭容量的影響，同時給出了各種情況下系統容量，用以指導cdma系統的網路規劃。
  4. Although the congestion control research of host - ends has made great strides, the current queue management mechanism in router is not able to provide end - to - end congestion control mechanism to sustain the above environment, namely, the unfairness of assigned bandwidth or drop - rate for different types of flows and the synchronization of all tcp flows in network. so it is necessary to improve the classical queue management mecnanism such as drop _ tail and red in order to boost the qos ( quality of service ). this article analyzes the main traits of host - ends congestion control and all kinds of fashionable queue management machanism, which include queue mechanism with absolute priority, weighted fair queue mechanism and class - based queue mechanism

    本文分析了主機端的擁塞控制機制和網路中路由器的現有各種隊列管理機制：絕對優先級隊列機制、加權公平隊列（ weightedfairqueue ） [ 1 ]機制、基於類的隊列（ class - basedqueue ） [ 2 ]機制以及red （ randomearlydetection ） [ 3 ]機制的主要特點，並重點針對ietf （ internetengineeringtaskforce ）推薦的把red演算法與明確的擁塞通告ecn （ explicitcongestionnotification ） [ 4 ]結合的方法進行了分析，發現隨著internet流量的日益遞增， red機制的依賴平均隊列長度來管理擁塞控制的演算法並不能有效地阻止包丟失：與drop - tail相比， red確實消除了對陣發流量（ tcp ）的偏見，但是增加了平滑流量（ udp ）的丟包概率。
分享友人
分享到 Line

分享到臉書