組播樹 的英文怎麼說

中文拼音 [zǔbōshù]
組播樹 英文
multicast tree
  • 組 : Ⅰ名詞1 （由不多的人員組成的單位） group 2 （姓氏） a surname Ⅱ動詞（組織） organize; form Ⅲ量詞（...
  • 播 : 播名詞（姓氏） a surname
  • 樹 : Ⅰ名詞1 （木本植物的通稱） tree 2 （姓氏） a surname Ⅱ動詞1 （種植; 栽培） plant; cultivate 2 （樹...
  1. 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

    模擬結果表明，該演算法在考慮網路的負載均衡情況下，選擇鏈路代價較低的空閑路徑，快速、有效地構建滿足時延要求，鏈路代價最小的組播樹。
  2. In this algorithm, we represent the chromosomes of the multicast tree by tree structure coding

    本演算法利用樹型結構的編碼來表示組播樹的染色體。
  3. A delay - constrained multicast routing algorithm based on shared tree

    一種時延受限共享組播樹演算法
  4. This paper is to research into the transmission technology for p2p - based media streaming of application layer multi - cast in a tree structure so as to ensure the computer to deliver the same data to the users without forming data storm

    摘要研究了應用層組播的p2p流媒體傳輸技術，給出了應用層組播樹的結構，使得樹的結構能夠保證用戶計算機不互相傳送同樣的數據而形成數據風暴。
  5. In the design of crossover, we first merge two parent trees to a graph, and then create a multicast tree from the graph. based on the method, the algorithm have a good performance of crossover

    在雜交運算元的設計上，通過對兩個父代個體結合，然後再生成組播樹的方法，使演算法具有較好的雜交性能。
  6. Based on the mfc ( multicast forwarding cache ) formed by multicast protocol such as dvmrp ( distance vector multicast routing protocol ), pim ( protocol independent multicast ), we can build special lsp ( lable switch path ) for certain source group couple to transport multicast data flow using ldp ( lable distribute protocol ) or cr - ldp. based on the zxb10 switching router of zte co. we can now support dvmrp within the context of mpls networks

    本文主要研究mpls網路對ip組播業務的支持，根據現有的ip組播協議如dvmrp 、 pim等所生成的組播轉發表（轉發樹） ，利用mpls網路的ldp （標記分發協議） cr - ldp （顯式路由標記分發協議）為特定的源組對確立lsp （標記交換路徑） 。
  7. In order to solve the qos constrained multicast routing in mpls network, including bandwidth, delay, delay jitter, loss rate and cost, we construct a globally optimizing ant algorithm. based on the ant algorithm and qos, we study and develop an algorithm which can repair the multicast routing tree when the network multicast links fail. this algorithm can make traffic rerouting, recover network from failure and improve the ability of resilience

    本文探討了在mpls網路中，使用螞蟻演算法解決了包含帶寬、延時、延時抖動、包丟失率和最小網路費用等約束條件在內的服務質量組播路由問題；並且在考慮服務質量的基礎上，研究並設計了在網路出現鏈路故障之後，對組播路由樹進行補救的演算法，使得網路的業務流可以重路由，網路故障得到恢復，提高了網路的恢復力。
  8. This thesis began with the basic concept of multicast, described the principles, merits together with flaws of most ip multicast routing protocols and gave the summary of source specific routing protocols and shared tree routing protocols. then the author analyzed the problem on current scalable reliable multicast protocols and the improvement as well as limitations of previous works in great detail

    本文從組播的基本概念出發，講述了各種組播路由協議的原理以及優缺點，給出基於源路由樹與共享樹的組播路由協議的總結，並詳細分析了目前可擴展性可靠組播所存在的問題以及前期的一些方案對這方面的改進和局限性。
  9. A fundamental issue in multicast communication is how to construct low - cost trees that will satisfy the quality of service ( qos ) requirements and spanning all destinations

    組播問題關鍵是在於建立一棵滿足qos約束條件且覆蓋所有目的節點的最優組播樹。
  10. The main purpose of multicast routing is to construct a tree rooted at the source and spanning all destinations, while the quality of services ( qos ) be satisfied

    組播路由演算法的目標是尋找一棵連接源節點和多個目的節點的組播樹，同時滿足各種服務質量需求。
  11. Lastly, we select bounded paths satisfying delay variation from them to develop a delay and delay variation constrained multicast tree. we compare the proposed algorithm with some exists algorithm in system running time and success rate

    然後，從得到的若干路徑中選取滿足時延差別約束的源節點到各目的節點的路徑，從而得到一棵滿足時延和時延差別約束的組播樹。
  12. The simulated experiment indicates that stbmr ’ s tree ’ cost is up to 4 % more than kpp, while average running time is 54 % less than it

    實驗表明， stbmr演算法構造的組播樹費用比kpp演算法構造的約大4 % ，演算法執行時間比kpp演算法約少54 % 。
  13. Tree construction is a commonly used approach in solving the multicast routing problem. one advantage of multicast tree is that data are distributed to different multicasting destinations along the branches in parallel, which reduces the delay. the other is that message need only be replicated at forking nodes, which minimizes the data replication, spares the network bandwidth, reduces the network load and lessens the congestion

    實現組播的一般方式是建立組播樹，組播樹的優點在於：首先，信息以并行方式沿著樹枝發送到不同的組播終點，從而降低了信息傳遞的時延；其次，信息的復制只在樹的分支處進行，因此網路中需要傳送的復制信息量最少，能夠節約網路帶寬資源，降低網路負載，減少擁塞。
  14. A least redundant packets multicast tree sharing algorithm based on obs networks

    網路的一種最少冗餘包的組播樹共享演算法
  15. 3. to improve the performance of multicast tree, a rearrangement dynamical multicast routing based on clone selection is proposed

    3 、為了改善組播樹的性能，本章提出了基於免疫克隆選擇的重構動態組播路由演算法。
  16. Thus multicasting is mostly researched and utilized at present. multicast routing algorithms are used to compute multicast trees that satisfy quality of service requirement

    組播路由演算法主要用來建立一棵性能良好的組播樹，並使它能夠滿足各種業務的服務質量需求。
  17. A region of multicast tree degraded to a certain extent, rearrangement must be initiated. the simulations show that the performance of improved multicast tree is steady relatively and is not worsen

    實驗表明該演算法所求得的組播樹的性能相對穩定，不會隨加入或離開操作增加而性能迅速下降。
  18. The second one is multicast routing algorithm based on clone selection algorithm, clone selection algorithm is a global optimization algorithm and can improve the performance of multicast tree

    第二種是基於免疫克隆選擇演算法的組播路由演算法，該演算法利用了免疫克隆選擇演算法全局搜索能力，提高組播樹的性能。
  19. Given the multicast request, the optimal object of the problem is to minimize total number of conversions required. in wavelength assignment, we should consider the requirements that the number of needed converters along the path from multicast source node to any member cannot be larger than specified value because of the signal distortion introduced by wavelength converters. at last, we present several dynamic programming to get the exact optimal wavelength assignment scheme under session blocking policy and destination blocking policy

    考慮到波長轉換器引入的信號失真和噪聲，引進了失真約束，即要求從組播源結點到每個組播成員的路徑上使用的波長轉換器數目均在指定的范圍之內;對于給定的組播需求，優化目標是在滿足失真約束的基礎上使整個組播樹上使用波長轉換器的數目最少;並使用動態規劃給出了sbp和dbp兩種連接建立策略下精確的最優波長分配演算法。
  20. On the above, to overcome the pre - maturity and low speed of search in the late phase of multicast routing algorithm based on genetic algorithm, the author gives the multi - population parallel annealing genetic multicast routing algorithm to solve the bandwidth, delay, delay jitter and packet loss constrained least - cost multicast routing problem, which combines the

    在此基礎上，將多種群并行技術和退火技術相結合，以克服現有基於遺傳演算法的組播路由演算法過早收斂和後期搜索速度較慢的缺陷，且使用樹狀編碼方法，提出求解帶寬、時延、時延抖動和分組丟失率約束的代價最小組播樹的多種群并行退火遺傳組播路由演算法。
分享友人
分享到 Line

分享到臉書