The Über-FiWi network: QoS guarantees for triple-play and future Smart Grid applications
Bibliographic record
Abstract
In the future, communications networks are expected to become less an end itself than a means to an end by exploiting them not only for telecommunications per se but also across other relevant economic sectors in order to reap larger benefits from interdisciplinary research across traditional borders, e.g., an increased overall reduction of greenhouse gas emissions across multiple sectors such as energy and transportation, as envisioned by the future Smart Grid. The two main quality attributes of a Smart Grid communications infrastructure are reliability and latency, as defined in IEEE P2030. This paper proposes to aggregate triple-play and Smart Grid services into a converged fiber-wireless (FiWi) broadband access network based on low cost Ethernet passive optical network (EPON) and wireless mesh networks. We first show that, as the load of the FiWi network increases, performance degradation in terms of packet drop and latency of Smart Grid applications occurs due to the lack of quality-of-service (QoS) protection. To mitigate this problem, we propose an adaptive admission control algorithm to provide QoS support for FiWi Smart Grid communications networks. Simulation results show that the proposed admission control enables QoS guarantees for triple-play applications as well as future Smart Grid applications over the same FiWi infrastructure.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| 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.002 | 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".