constraint-based routing 中文意思是什麼

constraint-based routing 解釋
基於約束的路由選擇
  • constraint : n. 1. 強迫，拘束。2. 約束，壓抑，拘泥。3. 強制力。4. 緊張感[狀態]。
  • based : 基準
  • routing : 安排程序
  1. 2. presenting banyan network ' s propert, conflict and the neccesary and sufficent condions of conflict. then, three routing algorithms are presented on realizing permutation routing based on time domain approach under the constraint of avoiding crosstalk, and the complexity of the algotithms are analysed

    2 、給出了banyan網路的一些性質及實現置換路由的沖突次數及發生沖突的充要條件，並且給出了基於時域法的無串擾的實現置換路由的三種調度演算法，討論了演算法的時間復雜度以及所需要的調度次數的上界。
  2. A solution for traffic engineering design based on gmpls is demonstrated in this study. the solution is based on the analysis of the technical theory, implementation mechanism and core technology of gmpls and featured in its constraint - based routing. by using the expansion and combination of the existing protocols, the solution composes of 4 parts : packet forwarding module, information distribution module, path selection module and signaling module

    本文的研究工作是作者在大唐電信「基於wdm技術的多業務智能光網路系統」可行性研究小組在gmpls研究方面的一部分，在對gmpls的基本技術原理、實現機制以及核心技術進行研究分析的基礎上，針對gmpls的約束顯式路由技術特點，作者在本文設計了一種基於gmpls的流量工程解決方案，它充分利用了現有協議的簡單擴展和組合，該解決方案包括四個基本組成部分：包轉發單元、信息發布單元、路徑選擇單元和信令單元。
  3. A distributed qos unicast routing algorithm based on delay constraint

    多播路由演算法
  4. The last one is delay - bound constraint multicast routing algorithm based on clone selection and ant colony algorithm, it overcomes the drawbacks of slow convergence rate and easily falling into the local optimum

    第三種演算法是基於克隆蟻群的組播路由演算法，該演算法克服了蟻群演算法收斂速度慢，且易陷入局部最優的缺陷。
  5. This leads to great challenge to current network technology. for its outstanding ability on constraint - based routing and multi - protocol encapsulation, more and more isps accept mpls as fundamental technology for future networks

    依據在約束路由和多協議封裝兩方面的巨大優勢，多協議標簽交換（ mpls ）已經被越來越多的服務商接受為未來網際網路絡的基本技術。
  6. At first, various existing dynamic multicast routing algorithms with no constraint is compared. a dynamic multicast algorithm dpg ( dynamic prim - based greedy multicast algorithm ) which is based on minimum span tree is presented

    在比較了典型的動態無約束費用優化多播路由演算法后，提出了基於最小生成樹的動態貪婪演算法? ?一dpg演算法。
  7. Qos routing optimization approach with time delay constraint based on ant colony adaptive algorithm

    具有時延約束網路路由問題的自適應蟻群優化演算法
分享友人
分享到 Line

分享到臉書