鏈路請求 的英文怎麼說

中文拼音 [liànlùqǐngqiú]
鏈路請求 英文
lr link request
  • 鏈 : Ⅰ名詞1. （鏈子） chain Ⅱ動詞（用鏈栓住） chain; enchain Ⅲ量詞（計量海洋上距離的長度單位） cable length
  • 路 : 1 （道路） road; way; path 2 （路程） journey; distance 3 （途徑; 門路） way; means 4 （條理） se...
  • 請 : 動詞1. （請求） request; ask 2. （邀請; 聘請） invite; engage 3. （招待; 款待） entertain 4. [敬] （用於希望對方做某事） please
  • 求 : Ⅰ動詞1 （請求; 要求） ask; beg; request; entreat; beseech : 求人幫忙 ask sb a favour; ask a favou...
  • 鏈路 : chain circuit; periodic line; link; link circuit; path of chain
  • 請求 : ask; request; demand;beg:請求寬恕ask for forgive ness; 請求某人幫忙 ask a favour of sb ; 請求一項...
  1. The first chapter of this paper analyses the background and meaning of the establishment of disciplines navigation system for network resources. with the rapid increase of network academic information resource, search engine as the web primary retrieval tool can " t meet the retrieval request of specialty information resources ; traditional cataloging techniques can " t meet the needs of magnanimous network academic resources ; most of the " navigation of networks " established by libraries are the simple link of websites. it lacks the necessary revelation and evaluation of resources content

    本文在第1章分析了網路資源學科導航系統建設的背景和意義：隨著網路學術信息資源的飛速增長，作為web主流檢索工具的搜索引擎難以高效、準確、全面地完成專業信息資源的檢索請求；傳統編目技術也無力承擔海量網路學術資源編目的需求；圖書館所建的「網海導航」多數為對網站（頁）的鏈接，缺乏對資源內容必要的揭示與評價；國內對網路學術資源標準化的研究也相對滯後於國外。
  2. 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場人演算法模擬，利用新的鏈路權重函數使得演算法具有更優的性能，使網路具有更低的連接阻塞率。
  3. 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演算法，提出了一種支持優先級的動態波長分配演算法，該演算法保證了較高優先級的光路建立請求具有較低的阻塞率，比原有演算法更加適合現代光網路中不同業務請求對應不同服務等級的要求。
  4. In sna, a request unit sent only in reaction to a received request unit ; for example, quiesce complete is the reply sent after receipt of quiesce at end of chain

    在系統網路體系結構（ sna ）中，僅對接受的請求單元進行反饋時發送的一種請求單元。例如，在接受了「鏈結束停頓」后發送「停頓完成」應答。
  5. Then the result of certain k - shortest path algorithm is introduced as a set to be chosen by both the simulated anneal algorithm and heuristic algorithm, concerning the end - to - end traffic requirement and restriction on link bandwidth. afterwards, the effect of the value k on the outcome of the simulated anneal algorithm is researched. the network resource is allocated, while the study of link protection problem on traffic routing is introduced and two types of protection, shared protection and dedicated

    首先考察實際的網路模型，根據業務需求，引入k路由演算法的結果作為模擬退火演算法和啟發性演算法備選路由集合，在鏈路帶寬有限的約束下對網路資源進行分配，同時引入業務路由的通路保護問題的研究，實現了共享保護和專用保護兩種通路保護方式;針對全波長轉換網路和無波長轉換能力網路，根據為所有連接請求所分配的總資源最少和滿足請求的業務數目最多兩種優化目標對資源分配進行優化，研究了備選路由集大小對模擬退火演算法結果的影響;對模擬退火演算法與啟發性演算法的
  6. Incoming requests can be routed to outgoing partner links

    引入的請求能夠路由到外部夥伴鏈接。
分享友人
分享到 Line

分享到臉書