In this dissertation, algorithms for generating multicast trees with a trade-off in delay and bandwidth consumption are investigated. The Ameliorated Shortest Path tree (ASPT) is proposed.
在本文中，探讨了平衡延迟和带宽消耗的算法，提出了改进的最短路径树算法(ASPT)。
In this dissertation, algorithms for generating multicast trees with a trade-off in delay and bandwidth consumption are investigated. The Ameliorated Shortest Path tree (ASPT) is proposed.
在本文中，探讨了平衡延迟和带宽消耗的算法，提出了改进的最短路径树算法(ASPT)。
应用推荐