2006
DOI: 10.1007/s00530-006-0019-z
|View full text |Cite
|
Sign up to set email alerts
|

Sequence of linear programming for transmission of fine-scalable coded content in bandwidth-limited environments

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 finescalable 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 p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2007
2007
2013
2013

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 20 publications
0
5
0
Order By: Relevance
“…Each of this LP subproblem determines a peer allocation to maximize the number of received bits in a given delay bound. Unlike our our work, the work in [20] does not consider the characteristics of the R-D curves of video sequences. A framework to solve the problem of streaming interdependent packetized video data units over lossy networks in R-D optimized fashion is proposed [21].…”
Section: Related Workmentioning
confidence: 93%
See 1 more Smart Citation
“…Each of this LP subproblem determines a peer allocation to maximize the number of received bits in a given delay bound. Unlike our our work, the work in [20] does not consider the characteristics of the R-D curves of video sequences. A framework to solve the problem of streaming interdependent packetized video data units over lossy networks in R-D optimized fashion is proposed [21].…”
Section: Related Workmentioning
confidence: 93%
“…Su and Wang consider a minimization problem for the transmission time of FGS-encoded images in [20]. They formulate the problem as a non-linear program, and then they transform it to a series of LP subproblems.…”
Section: Related Workmentioning
confidence: 99%
“…Each LP subproblem determines a peer allocation to maximize the number of received bits in a given delay bound. Unlike our work, the work in Su and Wang [2006] does not consider the characteristics of the R-D curves of video sequences. A framework to solve the problem of streaming interdependent packetized video data units over lossy networks in R-D optimized fashion is proposed in Chou and Miao [2006].…”
Section: Related Workmentioning
confidence: 98%
“…Different from our work, these two studies employ coarse-grained scalability, and they are not R-D optimized. Su and Wang [2006] consider a minimization problem for the transmission time of FGS-encoded images. They formulate the problem as a nonlinear program, and then they transform it to a series of LP subproblems.…”
Section: Related Workmentioning
confidence: 99%
“…One kind is focus on the research on the Rate-Distortion mode. At present, the R-D mode may roughly divide into three kinds: (Dai and Loguinov, 2003;Park and Lee, 2004;Dai, 2004;Sun et al, 2005) • Experimental R-D model (Zhang et al, 2003) • Hybrid R-D model Another kind is the optimized QoS technology of video streaming media and this type of optimized technology mainly focus on two aspects including the optimal partition of FGS video sequence (Radha et al, 2001;Van Der Schaar and Radha, 2002;Liu et al, 2003) and receiving peer driven bit allocation (Su and Wang, 2006;Chou and Miao, 2006;Cuetos et al, 2005). For the mobile P2P technology, Cheng et al from Taiwan University of science and technology applies the P2P technology into the Ad Hoc network of mobile Phone and propose the mobile business construction based on the Ad Hoc network of mobile phone and improve the message mechanism for sale mode based on the character of P2P.…”
Section: Literature Reviewmentioning
confidence: 99%