2007 IEEE International Parallel and Distributed Processing Symposium 2007
DOI: 10.1109/ipdps.2007.370465
|View full text |Cite
|
Sign up to set email alerts
|

A Minimal Access Cost-Based Multimedia Object Replacement Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2010
2010
2016
2016

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 14 publications
0
4
0
Order By: Relevance
“…Another group of policies surveyed in [23]: GDSF, LRUThreshold, LRU-Min, SIZE, LOG2-SIZE, PSS, LRU-LSC, Partitioned Caching, HYPER-G, CSS, LRU-SP, GD-Size, GD * , TSP, MIX, HYBRID, LNC-R-W3, LUV, HARMONIC, LAT, GDSP, LRU-S, including LNC-R-W3-U [42], SE [43], R-LPV [44], Min-SAUD [45], OPT [46], LPPB-R [47], OA [48], CSP [49], GA-Based Cache Replacement Policy [50], improved GD * [51] and SzLFU(k) [52] consider object sizes in such a way that replacing big objects first, thus neither aiming for cloud scalability nor economy.…”
Section: Object Size Downloading Monetary Cost and Access Frequencymentioning
confidence: 99%
“…Another group of policies surveyed in [23]: GDSF, LRUThreshold, LRU-Min, SIZE, LOG2-SIZE, PSS, LRU-LSC, Partitioned Caching, HYPER-G, CSS, LRU-SP, GD-Size, GD * , TSP, MIX, HYBRID, LNC-R-W3, LUV, HARMONIC, LAT, GDSP, LRU-S, including LNC-R-W3-U [42], SE [43], R-LPV [44], Min-SAUD [45], OPT [46], LPPB-R [47], OA [48], CSP [49], GA-Based Cache Replacement Policy [50], improved GD * [51] and SzLFU(k) [52] consider object sizes in such a way that replacing big objects first, thus neither aiming for cloud scalability nor economy.…”
Section: Object Size Downloading Monetary Cost and Access Frequencymentioning
confidence: 99%
“…Our idea is different from this by the use of grading parameter worthiness, which incorporates object attributes and traffic parameters to a single factor. The worthiness parameter has advantages over the other parameters such as grade (Bian and Chen 2008), cost (Li et al 2007;Cao and Irani 2002) and popularity (Chen and Zhang 2003;Jin and Bestavros 2000) as it is comprehensive and generic. So, the worthiness parameter can be tuned for a specific form of content distribution (e.g., multimedia caching and object prefetching).…”
Section: The Proposed Content Classification Schemementioning
confidence: 99%
“…The notion of object worthiness is similar to rank (Chen and Zhang 2003;Jin and Bestavros 2000), cost (Li et al 2007;Cao and Irani 2002) and page grade (Bian and Chen 2008) but is different in definition and in the method of computation. The above parameters classify the objects according to cache-ability, popularity, size and cost of fetching and captures these parameters online.…”
Section: Object Worthinessmentioning
confidence: 99%
See 1 more Smart Citation