Time-Varying-Aware Network Traffic Prediction Via Deep Learning in IIoT
Bibliographic record
Abstract
With the rise of the Industrial Internet of Things (IIoT), more and more industrial devices can be connected via the network. Data collection, processing, analysis, task execution, and other devices that can product network traffic volume are gradually being deployed to IIoT. However, under the limited spectrum resources and low-cost and low-energy production requirements of enterprises, how to ensure the interconnection and intercommunication of industrial networks while realizing the effective use of network communication resources is currently a hot topic. Among them, network traffic prediction is considered to be a very important task. The time variability and interpretability, especially the time-varying features of traffic sequences, greatly challenge this task. To address those, this article proposes a method called <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Flow2graph</i> to predict network traffic in IIoT. Specifically, some key segments, i.e., shapelets are extracted from the network traffic sequence according to time-varying traffic; then uses the relationship between the traffic sequence and shapelets to convert the flow into a shapelets conversion graph; Subsequently, the graph isomorphism network are used to learn the specificity of the flow sequence from different devices, thereby to predict its traffic value for a period of time in the future; finally, we conduct extensive experiments on real data to verify the effectiveness of the proposed method.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.002 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".