Optimal rate allocation in overlay content distribution

Authors:
Chuan Wu;Baochun Li
Affiliations:
Department of Electrical and Computer Engineering, University of Toronto;Department of Electrical and Computer Engineering, University of Toronto
Venue:
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Year:
2007

Citing 5
Cited 4

The auction algorithm for the transportation problem

Annals of Operations Research
Data networks (2nd ed.)

Data networks (2nd ed.)
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Bullet: high bandwidth data dissemination using an overlay mesh

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs

Operations Research Letters

Design and performance evaluation of a content distribution overlay optimized for streaming

SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
Design, optimization and performance evaluation of a content distribution overlay for streaming

Computer Communications
Modeling and optimization of survivable P2P multicasting

Computer Communications
On modelling of fair throughput allocation in overlay multicast networks

NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 between elastic and streaming content 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.