Optimal Rate Allocation in Overlay Content Distribution
Optimal Rate Allocation in Overlay Content Distribution
复制标题
DOI：
10.1007/978-3-540-72606-7_58
复制
发表时间：
2007-05
期刊：
影响因子：
--
通讯作者：
Chuan Wu;Baochun Li
中科院分区：
文献类型：
--
作者：
Chuan Wu;Baochun Li
为了有效利用有限的带宽，本文研究了覆盖内容分发中的最优速率分配问题。通过将讨论分为四个典型场景，我们系统地提出了一系列最优的速率分配策略。根据特定于应用的要求，这些场景反映了弹性内容分发和流媒体内容分发之间的差异，以及每链路或每节点的容量限制。在每种情况下，我们证明了最优速率分配问题可以表示为一个线性优化问题，该问题可以以完全分布式的方式有效地求解。在仿真中，我们研究了我们的分布式算法在静态和动态网络中的收敛情况，并证明了它们的有效性。
This paper addresses the optimal rate allocation problem in overlay content distribution for efficient utilization of limited bandwidths. We systematically present a series of optimal rate allocation strategies by dividing our discussions into four typical scenarios. Based on application-specific requirements, these scenarios reflect the contrast betweenelasticandstreamingcontent distribution, with either per-link or per-node capacity constraints. In each scenario, we show that the optimal rate allocation problem can be formulated as a linear optimization problem, which can be solved efficiently in a fully distributed fashion. In simulations, we investigate the convergence of our distributed algorithms in both static and dynamic networks, and demonstrate their efficiency.