在这一算法的基础上，我们最后提出了一个基于贪婪法的代理任命算法。
Based on this algorithm, we finally propose our proxy placement algorithm designed in a greedy fashion.
进而，我们将目标等价转化为最大化由代理任命而引起的总链路传输次数减少量。
Further, we convert our goal into an equivalent of maximizing the reduction in the number of total link transmissions incurred by the placement of proxies.
在本文中，我们关注层次化可靠组播中的代理任命以最小化一对多数据传输所需的带宽。
In this paper, we focus on the issue of placement proxies for HRM to minimize the bandwidth required for data transfer from a single source to a number of receivers.
应用推荐