Our algorithms can effectively seek multiple destination connections in parallel thus the best path which satisfies the requirements of the anycast flow is chosen.

• 对于有时延约束和最小带宽要求的一个选播流，我们的算法能有效地并行查找多个目标以建立连接、并确保满足选播请求的最好路径得到选择。