摘要
基于Dijstra算法和MCP_IA算法1,该文提出了一种耗费受限的的最短时延路径CCLDA算法,并将其应用于时延和时延差异受限DDVCA算法,不仅满足了时延和时延差异限制,而且降低了最终所得组播树的耗费。
This paper puts forward a CCLDA(Cost Constrained Least Delay Algorithm)based on Dijstra Algorithm and MCP_IA.And then it is applied to DDVCA(Delay and Delay variation Constrained Algorithm)in order not only to satisfy the delay and delay variation constraint but also to reduce the multicast tree cost.
出处
《计算机工程与应用》
CSCD
北大核心
2004年第34期162-164,共3页
Computer Engineering and Applications
基金
2002年山东中青年科学家奖励基金
关键词
端到端时延
时延差异
耗费
组播树
end-to-end delay,delay variation,cost,multicast tree
