Sequence of linear programming for fine-scalable coded image transmission with delay bound

We study the problem of peer assignment to maximize the quality of transmitting fine-scalable coded images on peer-to-peer networks. The requesting peer has a delay constraint to display the images within a certain delay bound, and it has limited incoming bandwidth. Under these constraints, we first use a simple example to illustrate the peer assignment problem, and then formulate this problem as one linear programming problem and one nonlinear programming problem. Then we propose to solve the second nonlinear problem efficiently using a sequence of linear programming problems. Finally, extensive experiments show the superior performance of our algorithm by comparing it with a nonlinear formulation and with two heuristic schemes.