Bibliographic record
Abstract
Machine to machine (M2M) traffic is characterized as low-rate, small-packet traffic with correlated transmissions. In this paper, we propose a two-phase traffic control mechanism (2PTC) for carrying M2M traffic in the future fifth generation (5G) networks. In this mechanism, the packets from each machine are directed to a virtual serving gateway associated with the machine, which receives and aggregates traffic from multiple machines and forwards the aggregate traffic to the sink. The first communication phase takes place through a simple single-path routing technique, while the second phase is empowered by multipath traffic engineering (TE) optimization. At the virtual serving gateways, traffic aggregation (TA) may include network-layer flow trunking and application-layer content compression. At the core of 2PTC is joint gateway selection and machine-to-gateway association that favors TA potentials while minimizing association cost and virtual serving gateway count. The described problem is formulated as a mixed integer programming optimization problem. As the structure of the formulation is inherently NP hard, the problem is solved using relaxation and rounding techniques, whose solution quality is evaluated through numerical analysis. We also implement the solution in a network simulator and evaluate the performance of 2PTC, through extensive simulations. Simulation results indicate that routing M2M traffic to properly selected virtual serving gateways for TA can alleviate the large-quantity small-packet problem, while enhancing the performance of the background traffic. This paves the way for further performance enhancement or enabling new features when deploying virtual network functions at virtual serving gateways.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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".