CAJ | 학술논문

　　选播（manycast）作为一种新型的通信模式，吸引了研究人员越来越大的兴趣。MSPT（Manycast Shortest Path Tree）算法是一种应用广泛的选播路由算法。但是，它没有考虑整体网络资源的利用；DDMC（Destination-Driven for Manycast）算法较好地解决了单源点选播最小生成树问题，但应用场景只是针对“一个对多个中的任意个”。针对“多个对多个中的任意个”的多源选播路由问题，在DDMC算法的基础上作了一些改进。仿真实验结果表明，改进的选播路由算法MBLS（Manycast Based-Link-Share）基于链路共享机制，在空间复杂度和时间复杂度相同的情况下，在选播森林每源点成本上优于MSPT算法。
　　선파（manycast）작위일충신형적통신모식，흡인료연구인원월래월대적흥취。MSPT（Manycast Shortest Path Tree）산법시일충응용엄범적선파로유산법。단시，타몰유고필정체망락자원적이용；DDMC（Destination-Driven for Manycast）산법교호지해결료단원점선파최소생성수문제，단응용장경지시침대“일개대다개중적임의개”。침대“다개대다개중적임의개”적다원선파로유문제，재DDMC산법적기출상작료일사개진。방진실험결과표명，개진적선파로유산법MBLS（Manycast Based-Link-Share）기우련로공향궤제，재공간복잡도화시간복잡도상동적정황하，재선파삼림매원점성본상우우MSPT산법。
As a new kind of communication method, manycast is attracting increasing interest from researchers. Manycast Short-est Path Tree(MSPT)is a widely-used manycast routing algorithm. However, MSPT does not consider overall network resource utilization. DDMC(Destination-Driven for Manycast)can solve the minimal spanning tree problem for single source manycast, but it just considers“one-to-some-of-many”situation. Improvements have been made to solve“many-to-some-of-many”multi-source manycast routing problem on the basis of DDMC. Simulation results show that the modified algorithm MBLS(Manycast Based-Link-Share)outperforms MSPT in per-source manycast forest cost under the condition of the same space complexity and time complexity.