Please use this identifier to cite or link to this item:
|Title:||A window-assisted video partitioning strategy for partitioning and caching video streams in distributed multimedia systems|
Distributed multimedia system
|Source:||Li, X., Veeravalli, B., Prasanna, V.K. (2007-06). A window-assisted video partitioning strategy for partitioning and caching video streams in distributed multimedia systems. Journal of Parallel and Distributed Computing 67 (6) : 738-754. ScholarBank@NUS Repository. https://doi.org/10.1016/j.jpdc.2006.11.002|
|Abstract:||In this paper, we address the issue of efficiently streaming a set of heterogenous videos under the constraint of service latency over a scalable multimedia systems. We propose a novel strategy, referred to as window-assisted video partitioning (WAVP), for rendering cost-effective multimedia services. The objective is to minimize the service cost and maximize the number of requests that can be successfully served under resources constraints (cache capacity and link bandwidth). We formulate the problem of video partitioning as an optimization of both bandwidth resources and cache space, and derive the optimal schedule window for different video portions under consideration of time constraints, the popularities and the sizes of the video portions. In WAVP, video are partitioned into multiple portions and delivered according to by adaptive schedule windows. We prove that WAVP strategy not only optimize the service cost but also be able to serve requests under the time constraints without causing too much delay. We conduct mathematical analysis and derive certain performance bounds that quantify the overall performance of the strategy. It shows that the service cost can be optimized by adjusting the schedule window and resources utilization can be improved as video streams are partitioned into multiple portions. We evaluate the performance under several influencing parameters such as available bandwidth, cache capacity, and partition gradients. Simulation results show that our proposed method can not only significantly reduce the service cost under tight time constraints and with low partition overhead, but also balance the utilization of network resources to achieve high acceptance ratio with low average service cost. © 2007 Elsevier Inc. All rights reserved.|
|Source Title:||Journal of Parallel and Distributed Computing|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 26, 2018
WEB OF SCIENCETM
checked on Feb 26, 2018
checked on Feb 25, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.