&lt;title&gt;Optimizing patching performance&lt;/title&gt;

Cai, Ying; Hua, Kien A.; Vu, Khanh

doi:10.1117/12.333810

Cited by 95 publications

(98 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The skyscraper broadcasting scheme [15,22,31] is another example of these new techniques. A number of related techniques go under the names of batching [1,9,10], patching [6,16,21], tapping [7,8], and piggy-backing [2,18,19,29] and the general problem has several parameters and useful performance metrics. Other parameters include delay guarantees, receiving bandwidth, server bandwidth, and buffer size [5, 13-15, 17, 20, 23-27, 30-35].…”

Section: Introductionmentioning

confidence: 99%

The Dyadic Stream Merging Algorithm

Coffman

Jelenković

Momčilović

2002

Journal of Algorithms

View full text Add to dashboard Cite

We study the stream merging problem for media-on-demand servers. Clients requesting media from the server arrive by a Poisson process, and delivery to the clients starts immediately. Clients are prepared to receive up to two streams at any time, one or both being fed into a buffer cache. We present an on-line algorithm, the dyadic stream merging algorithm, whose recursive structure allows us to derive a tight asymptotic bound on stream merging performance. In particular, let λ be the Poisson request arrival rate, and let L be the fixed media length. Then the long-time ratio of the expected total stream length under the dyadic algorithm to that under an algorithm with no merging is asymptotically equal to 3 log λL 2λL . Furthermore, we establish the near-optimality of the dyadic algorithm by comparisons with experimental results obtained for an optimal algorithm constructed as a dynamic program. The dyadic algorithm and the best on-line algorithm of those recently proposed differ by less than a percent in their comparison with an off-line optimal algorithm. Finally, the worst-case performance of our algorithm is shown to be no worse than that of earlier algorithms. Thus, the dyadic algorithm appears to be the first near optimal algorithm that admits a rigorous average-case analysis.  2002 Elsevier Science (USA)

show abstract

Section: Introductionmentioning

confidence: 99%

The Dyadic Stream Merging Algorithm

Coffman

Jelenković

Momčilović

2002

Journal of Algorithms

View full text Add to dashboard Cite

show abstract

“…To serve the second client, the server delivers two segments, V [0, 2] and V [7,9]. It first seems that the server has to deliver V [7,9] again, but the delivery of this segment is actually delayed 3 time units, as compared to the previous approach. As a result, V [7,9] can be shared by the clients arriving in the next 3 time units.…”

Section: Dynamic Scheduling (Ds)mentioning

confidence: 99%

“…In this section, we compare the performance of the proposed techniques with that of Optimal Patching [7,6] 1 . Without loss of generality, we assume in our study that the system has only one video.…”

Section: Performance Studymentioning

confidence: 99%

“…This Piggybacking scheme was proposed in [13,19]. Some other non-periodic multicast schemes are proposed in [16,7,12,22,5,14,10,11]. These techniques allow a client to join some existing multicasts and the server needs to send the client only the missing portion of the video.…”

Section: Related Workmentioning

confidence: 99%

“…To address this problem, we can use vacant slot [0, 2] to deliver the last three time units of the video, V [9], V [8], and V [7]. To serve the second client, the server delivers two segments, V [0, 2] and V [7,9].…”

Section: Dynamic Scheduling (Ds)mentioning

confidence: 99%

See 2 more Smart Citations

Leveraging broadband access for true on-demand delivery of Internet videos

Cai

Chen

Wong

CCECE 2003 - Canadian Conference on Electrical and Computer Engineering. Toward a Caring and Humane Technology (Cat. No.03CH374

View full text Add to dashboard Cite

show abstract

Optimizing Patching‐based multicast for video‐on‐demand in wireless mesh networks

Xie

Hua

Ning

2009

Int J Communication

Self Cite

View full text Add to dashboard Cite

SUMMARYIn this work, we study the application of video-on-demand (VoD) in wireless mesh networks (WMN), a next generation edge technology to provide broadband data access in residential, business and even citywise networks. We adopt a Patching-based multicast technique to better utilize the bandwidth resources in the mesh network. We optimize the Patching-based multicast by addressing two critical problems, namely, the Minimum Cost Multicast Tree (MCMT) problem and the Maximum Benefit Multicast Group (MBMG) problem. The MCMT problem is to find a MCMT in the network. We show that finding such a tree in the WMN can be formulated as a graph theory problem, which is to find the tree with minimum number of non-leaf nodes, and which spans all the nodes in the multicast group. We further prove the problem is NP-hard and propose a fast greedy algorithm to accommodate the real-time feature of the VoD application. We solve the MBMG problem by minimizing the communication of a Patching group in the entire network. A Markov model is proposed to capture the growth of the multicast group in the WMN. Simulation study results validate the proposed solutions of the two problems.

show abstract

<title>Optimizing patching performance</title>

Cited by 95 publications

References 0 publications

The Dyadic Stream Merging Algorithm

The Dyadic Stream Merging Algorithm

Leveraging broadband access for true on-demand delivery of Internet videos

Optimizing Patching‐based multicast for video‐on‐demand in wireless mesh networks

Contact Info

Product

Resources

About