MétaCan
Menu
Back to cohort

A SDN-Assisted Energy Saving Scheme for Cooperative Edge Computing Networks

2019· article· en· W3009390414 on OpenAlexaff
Ali Alnoman, Alagan Anpalagan

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicIoT and Edge/Fog Computing
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer scienceEnhanced Data Rates for GSM EvolutionQueueing theoryQuality of serviceMarkov chainEdge deviceEdge computingScheme (mathematics)Load balancing (electrical power)Computer networkDistributed computingLayered queueing networkSoftware-defined networkingMarkov processMathematical optimizationMathematicsTelecommunications

Abstract

fetched live from OpenAlex

In this paper, an edge device sleeping mechanism is proposed to save energy in cooperative edge computing networks. Energy saving in the proposed scheme is obtained by implementing a software- defined networking (SDN)-assisted interactive On/Off operation on edge devices taking into account the quality of service (QoS) experienced by end-users. First, an optimization problem is formulated to reduce the number of active edge devices under the queueing probability constraint. Herein, edge devices are modeled as M/M/k queueing systems, whereas the square-root staffing rule is used to maintain the queueing probability below desired levels. Then, a load balancing mechanism is carried out to reduce the variations in resource utilization among edge devices. To this end, a discrete-time Markov chain (DTMC)-based algorithm is implemented to achieve the intended load balancing. Results show the effectiveness of the proposed scheme in achieving energy saving and maintaining the queueing delay at controlled levels.

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 distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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: Methods · Consensus signal: none
Teacher disagreement score0.950
Threshold uncertainty score0.802

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.017
GPT teacher head0.243
Teacher spread0.226 · 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 teacher head, not a consensus.

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

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

Citations7
Published2019
Admission routes1
Has abstractyes

Explore more

Same topicIoT and Edge/Fog ComputingFrench-language works237,207