Optimal resource allocation in overlay multicast
Optimal resource allocation in overlay multicast
复制标题
DOI：
10.1109/icnp.2003.1249758
复制
发表时间：
2003-11
期刊：
影响因子：
--
通讯作者：
Yi Cui;Yuan Xue;K. Nahrstedt
中科院分区：
文献类型：
--
作者：
Yi Cui;Yuan Xue;K. Nahrstedt
本文针对覆盖组播中的最优资源分配问题，提出了一种具有理论和实践双重意义的解决方案。从理论上讲，覆盖流之间的资源分配不仅受到网络容量的限制，而且还受到数据的限制，这主要是由于终端主机既是接收者又是发送者的双重角色。实际上，现有的分布式资源分配方案假设网络链路能够测量流量、计算和传递价格信号，而这些都不存在于今天的互联网中。我们应对这些挑战如下。首先，我们使用结合了网络约束和数据约束的非线性优化理论对问题进行形式化描述。基于我们的理论框架，我们提出了一种分布式算法，证明了该算法收敛于最优点，在该点上所有接收者的总效用最大化。其次，我们提出了一种基于终端主机的解决方案，它依靠终端主机的协调来完成最初分配给网络链路的任务。我们的解决方案无需对现有网络基础设施进行任何更改即可直接部署。
The paper targets the problem of optimal resource allocation in overlay multicast, which poses both theoretical and practical challenges. Theoretically, resource allocation among overlay flows is not subject to the network capacity constraint but also the data constraint, mainly due to the dual role of end hosts as both receivers and senders. Practically, existing distributed resource allocation schemes assume the network links to be capable of measuring flow rates, calculating and communicating price signals, none of which actually exists in the Internet today. We address these challenges as follows. First, we formalize the problem using nonlinear optimization theory, which incorporates both network constraint and data constraint. Based on our theoretical framework, we propose a distributed algorithm, which is proved to converge to the optimal point, where the aggregate utility of all receivers is maximized. Second, we propose an end-host-based solution, which relies on the coordination of end hosts to accomplish tasks originally assigned to network links. our solution can be directly deployed without any changes to the existing network infrastructure.