Optimal Rate Allocation in Overlay Content Distribution
This paper addresses the optimal rate allocation problem in overlay content distribution for efficient utilization of limited bandwidths. The authors systematically present a series of optimal rate allocation strategies by dividing the discussions into four typical scenarios. Based on application-specific requirements, these scenarios reflect the contrast between elastic and streaming content distribution, with either per-link or per-node capacity constraints. In each scenario, they 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, they investigate the convergence of the distributed algorithms in both static and dynamic networks, and demonstrate their efficiency.