A novel energy-saving method for campus wired and dense WiFi network applying machine learning and idle cycling techniques
Bibliographic record
Abstract
University campus networks need wired (ethernet) and dense wireless fidelity networks that have devices like access points, switches, and routers that are always turned on. Consequently, they generate two important problems: the energy bill and the influence of carbon dioxide into the atmosphere. Energy savings are the solution to those problems. There are several proposals to augment the energy savings separately in ethernet and wireless fidelity, but there is no integrated method to simultaneously reduce them in both parts of the networks. Our novel method combines idle cycling and machine learning techniques to efficiently obtain energy savings in both parts of the network simultaneously. We categorize network devices into two groups: (a) those that are always turned on and (b) those that can be dynamically turned on or off based on network performance. We formulated two algorithms that decide when to turn on and off access points. We use Ward's machine learning hierarchical clustering technique to optimize the energy savings of our model in the network of the Unidades Tecnológicas de Santander (Bucaramanga, Colombia). We showed that energy savings of 21.5 kWh per day are possible. The success of the model in this context highlights its potential to achieve substantial energy savings.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".