Performance Comparison of Different Cache-Replacement Policies for Video Distribution in CDN

Chejara, Umesh; Chai, Heung-Keung; Cho, Hyunjoon

doi:10.1007/978-3-540-25969-5_86

Cited by 6 publications

(2 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The tracker server finally selects the time range with a maximum value of the ratio of AR tr (i,b) and AC tr (i,b) , as in Equation (7).…”

Section: Buffering Based On Ratios Of Playback Requests To Chunk Copiesmentioning

confidence: 99%

“…To provide these networked PVR services with a large number of concurrent users in real time, it is essential to provide sufficient network bandwidth and fast responses to interactive operations. To this end, large-scale Content Delivery Networks (CDNs) have been employed to minimize the transmission delay between clients and servers by placing proxy servers close to clients [5][6][7]. CDNs can provide sufficient reliability and manageability for providing streaming services with a huge number of concurrent users without quality degradation, although they require a substantial investment in distributed CDN infrastructures to ensure timely delivery to the enormous users.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Cooperative Buffering Schemes for Time-Shifted Live Streaming of Distributed Appliances

Kim

Cho²

2021

Applied Sciences

View full text Add to dashboard Cite

Distributed appliances connected to the Internet have provided various multimedia services. In particular, networked Personal Video Recorders (PVRs) can store broadcast TV programs in their storage devices or receive them from central servers, enabling people to watch the programs they want at any desired time. However, the conventional CDNs capable of supporting a large number of concurrent users have limitations in scalability because more servers are required in proportion to the increased users. To address this problem, we have developed a time-shifted live streaming system over P2P networks so that PVRs can share TV programs with each other. We propose cooperative buffering schemes to provide the streaming services for time-shifted periods even when the number of PVRs playing back at the periods is not sufficient; we do so by utilizing the idle resources of the PVRs playing at the live broadcast time. To determine which chunks to be buffered, they consider the degree of deficiency and proximity and the ratio of playback requests to chunk copies. Through extensive simulations, we show that our proposed buffering schemes can significantly extend the time-shifting hours and compare the performance of two buffering schemes in terms of playback continuity and startup delay.

show abstract

“…The tracker server finally selects the time range with a maximum value of the ratio of AR tr (i,b) and AC tr (i,b) , as in Equation (7).…”

Section: Buffering Based On Ratios Of Playback Requests To Chunk Copiesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%