摘要
网络通信中的多播分为单树多播和成组多播。本文研究了具有带宽约束的静态多播路由问题，分别建立了基于带宽约束的单树多播和成组多播的数学模型并构造了相应的路由算法，利用此算法可使成组多播达到全局最优。
Multicast problems are classified as single-tree multicast and group multicast. Base on the study of static multicast problems with bandwidth constraint，mathematical models with bandwidth constraint for single-tree multicast and group multicast are established respectively. Corresponding routing algorithms are also developed. Using these algorithms，group multicast can be optimized globally .
出处
《电路与系统学报》
CSCD
2001年第1期32-34,共3页
Journal of Circuits and Systems
关键词
带宽约束
静态多播
网络通信
路由算法
Bandwidth constraint
static multicast
single-tree multicast
group multicast
