摘要
基于Dijkstra算法和MCP_IA算法,提出了一种耗费受限的最短时延路径算法(CCLDA),并将其应用于时延和时延差异受限的算法(DDVCA),并给出了算法实现的伪代码,不仅满足了时延和时延差异限制,而且降低了最终所得的组播树的耗费,更能满足现实需要。
This paper puts forward the CCLDA (Cost Constrained Least Delay Algorithm) based on Dijkstra Algorithm and MCP_IA, and then applies it to the DDVCA (Delay and Delay variation Constrained Algorithm) and gives code about the algorithm which is more situble for applications) so as not only to satisfy the delay and delay variation constraint but also to reduce the multicast tree cost.
出处
《重庆邮电学院学报(自然科学版)》
2006年第1期115-118,共4页
Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition)
关键词
端到端时延
时延差异
组播树
end to end delay
delay variation
multicast tree