2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) 2018
DOI: 10.1109/candarw.2018.00030
|View full text |Cite
|
Sign up to set email alerts
|

A Color-Based Cooperative Caching Strategy for Time-Shifted Live Video Streaming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…When users request content data from the chunks, Shiroma et al [13] demonstrated that network traffic can be reduced by caching popular chunks, based on access frequency, which varies depending on the playback position of content [13]. Okada et al [9] demonstrated that distributed cooperative caching is more efficient by assigning color tags to the segmented chunk data. We further divided the data into chunks and used the data corresponding to the SVC scheme described below.…”
Section: Cache Control Of Content On a Chunk Basismentioning
confidence: 99%
“…When users request content data from the chunks, Shiroma et al [13] demonstrated that network traffic can be reduced by caching popular chunks, based on access frequency, which varies depending on the playback position of content [13]. Okada et al [9] demonstrated that distributed cooperative caching is more efficient by assigning color tags to the segmented chunk data. We further divided the data into chunks and used the data corresponding to the SVC scheme described below.…”
Section: Cache Control Of Content On a Chunk Basismentioning
confidence: 99%
“…Taking the communication distance and the number of communication hops as reference indexes for selecting the caching location can also effectively reduce the load of BSs and improve the caching efficiency. Okada et al [ 37 ] calculate the communication volume between users and caching nodes from the access probability and the number of communication hops, and select the caching location based on the communication volume. On the Internet of Vehicles (IoV), Bitaghsir et al [ 38 ] proposed a caching placement algorithm based on Multi-Armed Bandit Learning, which selects the content to be cached in the roadside unit (RSU) according to the content popularity, and then uses the user social characteristics to select the optimal caching path.…”
Section: Placement Optimizationmentioning
confidence: 99%