1 / 12

Proxy-based Distribution of Streaming Video over Unicast/Multicast Connections

Proxy-based Distribution of Streaming Video over Unicast/Multicast Connections. Bing Wang, Subhabrata Sen, Micah Adler, and Don Towsley Umass CMPSCI Tech. Report 01-05. Contributions of This Paper. Develop a generalized allocation technique for minimizing the transmission cost.

shay-kim
Download Presentation

Proxy-based Distribution of Streaming Video over Unicast/Multicast Connections

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Proxy-based Distribution of Streaming Video over Unicast/Multicast Connections Bing Wang, Subhabrata Sen, Micah Adler, and Don Towsley Umass CMPSCI Tech. Report 01-05

  2. Contributions of This Paper • Develop a generalized allocation technique for minimizing the transmission cost. • Develop schemes that use proxy prefix caching as an integral part of bandwidth-efficient delivery in Internet-like environment. • Explore the impact of the developed transmission schemes coupled with the optimal cache allocation, the proxy cache size and availability of unicast versus multicast capability, on the resultant transmission cost.

  3. Streaming Model

  4. Parameters in The Model Goal: minimize

  5. Optimal Proxy Cache Allocation • Ai={mi | 0 ≤ mi≤ ni} : the set of possible prefixes for video i. • saving(mi) =Ci(0)-Ci(miu/bi) : the saving in transmission cost when caching an mi-unit prefix of video i over caching no prefix of the video at the proxy. • Optimization problem:

  6. Optimal Proxy Cache Allocation (continued) • This problem is a variant of 0-1 knapsack problem. • It can be solved by dynamic programming algorithm. • B(i, j) : the maximum saving in the transition cost for the first i videos in a proxy cache of size j. • Time complexity: O(NSK), K=max1≤i≤N|Ai|

  7. Unicast Suffix Batching (SBatch) • Sbatch schedules the transmission of the suffix from the server to the proxy as late as possible. • For any request arriving in time (0, vi], the proxy just forwards the single incoming suffix to the new client. • Assuming a Poisson arrival process, the average number of request in time [0, vi] is 1+viλi.

  8. Unicast Patching with Prefix Caching

  9. Unicast Patching with Prefix Caching (continued) • The average number of requests is 1+ 1+λi(vi+Gi). • The total length of patches from the server for these requests is therefore

  10. Multicast Patching with Prefix Caching

  11. Multicast Patching with Prefix Caching (continued) • Case 1: The average total length of patches is (λi Ti2)/2. Cost function: • Case 2: The average total length of patches from the server is λi (Ti-vi)2/2, because the average number of arrivals in this time interval is λi (Ti-vi) with average length of patch of (Ti-vi)/2. • Cost function:

  12. Multicast Merging with Prefix Caching (MMerge) • Closest Target policy is adopted. • Let pj be the probability of requiring a j-second prefix per unit of time for video i, 0≤j≤Li.

More Related