multicast tree 中文意思是什麼

multicast tree 解釋
組播樹
  • multicast : 多播
  • tree : n 特里〈姓氏〉。n 1 樹〈主要指喬木，也可指較大的灌木〉。 ★玫瑰可以稱為 bush 也可以稱為 tree 2 木...
  1. Combining the international newest research result of multicast tree, this paper get a series of high efficiency arithmetic of multicast tree problem with the method of increasing storage space, and this paper also takes into account the dynamic capability of arithmetic. in many research fields of multicast tree, many high - efficiency solutions were obtained in this paper. this paper has broadly discussed about multicast tree problem and obtained dmdt ( dynamic minimum distance tree ), fmph ( fast minimum path cost heuristic ), dmph ( dynamic minimum path cost heuristic ) and fgmra ( fast group multicast routing arithmetic )

    本篇論文對多播生成樹問題進行了比較全面的討論，涉及內容包括單約束的單樹多播、單約束的成組多播等多個方面，所提出的動態最短路徑樹演算法dmdt （ dynamicminimumdistancetree ） ，最小代價多播生成樹演算法fmph （ fastminimumpathcostheuristic ）動態最小代價多播生成樹演算法dmph （ dynamicminimumpathcostheuristic ） ，成組多播快速路由演算法fgmra （ fastgroupmulticastroutingarithmetic ） ，都取得了顯著的效果，是目前同類問題中比較好的解決方案，達到了預期的目的。
  2. 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

    模擬結果表明，該演算法在考慮網路的負載均衡情況下，選擇鏈路代價較低的空閑路徑，快速、有效地構建滿足時延要求，鏈路代價最小的組播樹。
  3. Analysis of the rooted - tree based multicast key distribution technique

    基於有根樹的多點傳送密鑰分配技術分析
  4. The delay and delay variation constrained minimum steiner tree problem is also researched. lcdvma ( low - cost delay variation - constrained multicast algorithm ) is proposed for this problem. low time complexity, low cost and constrained delay and low delay variation are achieved by only comparing minimum delay paths and minimum cost paths

    對于時延和時延差約束的最小steiner樹問題，提出了一種基於最小時延路徑和最小費用路徑的演算法?一lcdvma演算法，由於該演算法比較了通過中轉節點后的最低費用路徑和最短時延路徑，降低了運算復雜度，通過模擬得到了較小的網路費用和時延差，因此lcdvma演算法是一種具有低復雜度的時延和時延差約束的最小steiner樹的啟發式演算法。
  5. Then, according to the previous algorithm, we design and implement an mpls multicast rerouting mechanism, which consist of building a bi - direction multicast routing tree backup path, detecting the link failure, notifying the link and recovery. under the environment of mpls - linux, the author also studies traffic - driven mechanism of mpls and pim - sm, and also gives the readers a vista of the future of mpls multicast

    本文在mpls - linux環境下，還對以數據流為驅動機制的mpls和組播路由協議pim - sm的結合進行了有益的探索，並且為實現支持組播的lsr的解決方案打下了基礎，並對該論文的未來的工作進行了展望。
  6. In this algorithm, we represent the chromosomes of the multicast tree by tree structure coding

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

    一種時延受限共享組播樹演算法
  8. 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

    在雜交運算元的設計上，通過對兩個父代個體結合，然後再生成組播樹的方法，使演算法具有較好的雜交性能。
  9. As the determination of such optimal multicast routes was computationally intractable in polynomial time, a multicast routing algorithm based on genetic algorithm was proposed to simultaneously optimize different parameter, in which multiple multicast tree route solutions were generated

    由於多播路由的最優選擇問題在多項式時間內難以求解，提出一種使用遺傳演算法的路由演算法來同時優化不同的服務質量指標，計算產生出幾種路由樹。
  10. 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網路中，使用螞蟻演算法解決了包含帶寬、延時、延時抖動、包丟失率和最小網路費用等約束條件在內的服務質量組播路由問題；並且在考慮服務質量的基礎上，研究並設計了在網路出現鏈路故障之後，對組播路由樹進行補救的演算法，使得網路的業務流可以重路由，網路故障得到恢復，提高了網路的恢復力。
  11. 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

    本文從組播的基本概念出發，講述了各種組播路由協議的原理以及優缺點，給出基於源路由樹與共享樹的組播路由協議的總結，並詳細分析了目前可擴展性可靠組播所存在的問題以及前期的一些方案對這方面的改進和局限性。
  12. 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

    組播路由演算法的目標是尋找一棵連接源節點和多個目的節點的組播樹，同時滿足各種服務質量需求。
  13. 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

    然後，從得到的若干路徑中選取滿足時延差別約束的源節點到各目的節點的路徑，從而得到一棵滿足時延和時延差別約束的組播樹。
  14. 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

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

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

    3 、為了改善組播樹的性能，本章提出了基於免疫克隆選擇的重構動態組播路由演算法。
  17. Through analyzing the original topology of video multicast tree, we propose a novel self - organized agent protocol ( sl - soap ) which based on the shared loss model

    本文在研究和分析了視頻組播原始拓撲結構特點的基礎上，利用共享丟失模型，提出了一個代理動態自組織協議sl - soap 。
  18. 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

    實驗表明該演算法所求得的組播樹的性能相對穩定，不會隨加入或離開操作增加而性能迅速下降。
  19. 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

    第二種是基於免疫克隆選擇演算法的組播路由演算法，該演算法利用了免疫克隆選擇演算法全局搜索能力，提高組播樹的性能。
  20. If the reasonable multicast tree can be constructed, we can consume least network resources and achieve our task. this paper stepwisily gives a comprehensive study to multicast tree problem on the base of graph theory

    本篇論文在現代圖論研究的基礎上，由簡單到復雜，逐步深入，對多播生成樹問題盡可能的作出一個整體的，全面的探索和研究。
分享友人
分享到 Line

分享到臉書