MétaCan
Menu
Back to cohort
Record W2757150185 · doi:10.1109/access.2017.2754419

A Survey on Content Placement Algorithms for Cloud-Based Content Delivery Networks

2017· article· en· W2757150185 on OpenAlexaff
Mohammad A. Salahuddin, Jagruti Sahoo, Roch Glitho, Halima Elbiaze, Wessam Ajib

Bibliographic record

VenueIEEE Access · 2017
Typearticle
Languageen
FieldComputer Science
TopicCaching and Content Delivery
Canadian institutionsUniversité du Québec à MontréalConcordia UniversityUniversity of Waterloo
Fundersnot available
KeywordsCloud computingComputer scienceQuality of serviceAlgorithmServerContent delivery networkContent deliveryKey (lock)Distributed computingComputer networkOperating system

Abstract

fetched live from OpenAlex

This paper provides a comprehensive survey of content placement (CP) algorithms for cloud-based content delivery networks (CCDNs). CP algorithms are essential for content delivery for their major role in selecting content to be stored in the geographically distributed surrogate servers in the cloud to meet end-user demands with quality of service (QoS). Evidently, the key objectives of CP, i.e., cost and QoS, are competing. Cost is determined by the underlying cost model of the CCDN infrastructure while the delivered QoS is determined by where the content is placed in the CCDN. Therefore, we provide an overview of the content and the CCDN infrastructure. The overview of the content includes content characteristics and the influence of Online Social Networking on CP. The overview of the CCDN infrastructure includes elasticity and cost model, which affect CP. Our goal is to provide a holistic perspective of the aspects that impact CP algorithms and their efficiency. From the influential factors, we derive a set of design criteria for CP algorithms in CCDNs. We discuss the state-of-the-art CP algorithms for CCDNs and evaluate them against the well-motivated design criteria. We also delineate practical implications and uncover future research challenges.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.007
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Review · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.022

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.007
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0020.006
Science and technology studies0.0010.001
Scholarly communication0.0030.003
Open science0.0030.001
Research integrity0.0020.001
Insufficient payload (model declined to judge)0.0040.002

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.223
GPT teacher head0.337
Teacher spread0.114 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreReview

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations73
Published2017
Admission routes1
Has abstractyes

Explore more

Same venueIEEE AccessSame topicCaching and Content DeliveryFrench-language works237,207