该协议可搜索多条可行树枝，并能选择一条最优(或近优)树枝将新成员连接到多播树。

The protocol can search multiple feasible tree branches, and select the optimal or near optimal branch for connecting the new receiver to the multicast tree if it exists.

youdao

研究有度和延时约束的覆盖多播路由问题，提出了一个新的覆盖多播路由协议-延时受限的树协议（DBTP）。

The degree and delay constrained routing problem in overlay multicast was studied, and a new overlay multicast routing protocol called delay bounded tree protocol (DBTP) was proposed.

youdao

研究有度和延时约束的覆盖多播路由问题，提出了一个新的覆盖多播路由协议-延时受限的树协议（DBTP）。

The degree and delay constrained routing problem in overlay multicast was studied, and a new overlay multicast routing protocol called delay bounded tree protocol (DBTP) was proposed.

youdao