首页 | 官方网站   微博 | 高级检索  
     


Sequence of linear programming for transmission of fine-scalable coded content in bandwidth-limited environments
Authors:Xiao Su  Tao Wang
Affiliation:(1) Computer Engineering Department, San Jose State University, San Jose, CA 95192, USA;(2) Synopsys Inc., 700 E. Middlefield Road, Mountain View, CA 94043, USA
Abstract:In this paper, we propose an optimal peer assignment algorithm on peer-to-peer networks. This algorithm is designed to maximize the quality of transmitting fine-scalable coded content by exploiting the embedding property of scalable coding. To be more realistic, we assume that the requesting peer has a delay constraint to display the content within a certain delay bound, and it also has limited incoming bandwidth. We first use a simple example to illustrate the peer assignment problem, and then formulate this problem as a linear programming problem, followed by a nonlinear programming problem. To efficiently solve the second nonlinear problem, we transform it into a sequence of linear programming problems. Finally, we apply our proposed algorithm to both image and video transmissions in bandwidth-limited environments. Extensive experiments have been carried out to evaluate the complexity and performance of our approach by comparing it with both nonlinear formulation and two heuristic schemes. The results have verified the superior performance of our proposed algorithm.
Keywords:Sequence of linear programming  Scalable coding  Content delivery  Peer-to-peer networks
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号