A multithreaded based load balancing framework for video-on-demand systems

Vinay, A.; Prakash, Abhinav; Kumar, D. Suresh; Nagabhushan, K.; Anitha, T N

doi:10.1145/1980022.1980101

Cited by 1 publication

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lastly, in the functional mode (fast simulation), our simulator produces values for hit ratio 5 , number of block substitutions, and network bandwidth demanded in each round of service, as well as other more detailed information (if requested by user), such as system debugging data. In this mode, the proxy performs all its operations to preserve the coherent state of the system along the execution of the rounds of service, except the data I/O to move video block to and from the RAM.…”

Section: Basics Of the Measurement Processmentioning

confidence: 99%

“…4 One second of video per client in our experiments. 5 Corresponding to the availability, in the memory of the proxy, of the requested video blocks. 6 Thirty simulations were executed obtaining a confidence of at least 95 % to a confidence interval less than 1 % of the measurement value.…”

Section: Endnotesmentioning

confidence: 99%

“…However, contrary to caching algorithms, replication algorithms determine which objects should be replicated and in which servers the replicas must be carried out taking into account load balancing between the surrogate servers as the most important decision factor [4,5].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A novel caching algorithm for VoD proxy implementation and its evaluation including a new set of metrics for efficiency analysis

2015

View full text Add to dashboard Cite

Background: Video on demand (VoD) is a fast-growing digital service that requires a substantial amount of hardware resources for its implementation. To reduce the costs of running this service, an alternative is to use proxies that cache the most important portions of the video collection in order to meet the demand for this content in place of the primary server of the VoD system. Methods: To improve the efficiency of the proxies, we proposed a novel caching algorithm that explores the positioning of the active clients to determine the density of clients inside a time window existing in front of each video chunk. The algorithm attributes a higher caching priority to the video chunks with greater aggregate density in the memory. To evaluate our approach, we compared it with others of similar nature using both traditional metrics like hit ratio, as well as physical metrics such as the use of processing resources. This complementary set of metrics is produced by our simulator that, as far as we know, is the first one of its kind to enable the evaluation of hardware consumption used to implement the VoD proxy. Results: Results show that the novel algorithm can achieve a higher hit ratio while requiring a little more effort from the hardware. Additionally, it was identified that the processor constitutes the major bottleneck to this application when demand increases. Conclusions: Among the recent emergence of caching strategies which consider the positioning of clients as criterion for caching, the strategy of prioritizing the chunks with greater density of previous clients showed to be a more efficient solution.

show abstract

Section: Basics Of the Measurement Processmentioning

confidence: 99%