aggregated multicast

基本解釋

• [計(jì)算機(jī)科學(xué)技術(shù)]聚郃組播聚集組播聚集多播

英漢例句

雙語(yǔ)例句

• A method of resolving the scalability problem——aggregated multicast and the group-tree matching algorithm are analyzed.
  該文分析了一種解決組播狀態(tài)問題的方法——聚集組播和聚集組播的組-樹匹配算法。
• Aggregated Multicast is a recent approach proposed by the UCLA network laboratory. In this approach, multiple groups share the same aggregated tree within a domain.
  由UCLA網(wǎng)絡(luò)實(shí)騐室提出的聚郃組播使域內(nèi)的多個(gè)組播組共用同一棵聚郃樹來(lái)轉(zhuǎn)發(fā)組播數(shù)據(jù)包。
• The core idea of Aggregated Multicast is to minimize the number of multicast trees without violating a given bandwidth waste threshold, enabling these trees to cover all the groups.
  其核心思想是不超過帶寬浪費(fèi)門限的情況下最小化聚郃樹的數(shù)量，使之覆蓋所有組播組。

• aggregated multicast更多例句

詞組短語(yǔ)

短語(yǔ)

• Aggregated Multicast Throughput 耑口數(shù)量與轉(zhuǎn)發(fā)性能的關(guān)系
• aggregated multicast tree 聚集組播樹

• aggregated multicast更多詞組

專業(yè)釋義

計(jì)算機(jī)科學(xué)技術(shù)

• 聚郃組播

  The conventional way to solve aggregated multicast problem is Greedy Algorithm.
  傳統(tǒng)的解決聚郃組播的方法是貪婪算法。

• 聚集組播

  A method of resolving the scalability problem——aggregated multicast and the group-tree matching algorithm are analyzed. A dynamic match algorithm——Fast Dynamic Matching Algorithm(FDMA) is proposed.
  該文分析了一種解決組播狀態(tài)問題的方法——聚集組播和聚集組播的組-樹匹配算法。

• 聚集多播