A four-state Markov model for modelling bursty traffic and benchmarking of random early detection
Bibliographic record
Abstract
Active Queue Management (AQM) techniques are crucial for managing packet transmission efficiently, maintaining network performance, and preventing congestion in routers. However, achieving these objectives demands precise traffic modeling and simulations in extreme and unstable conditions. The internet traffic has distinct characteristics, such as aggregation, burstiness, and correlation. This paper presents an innovative approach for modeling internet traffic, addressing the limitations of conventional modeling and conventional AQM methods' development, which are primarily designed to stabilize the network traffic. The proposed model leverages the power of multiple Markov Modulated Bernoulli Processes (MMBPs) to tackle the challenges of traffic modeling and AQM development. Multiple states with varying probabilities are used to model packet arrivals, thus capturing the burstiness inherent in internet traffic. Yet, the overall probability is maintained identical, irrespective of the number of states (one, two, or four), by solving linear equations with multiple variables. Random Early Detection (RED) was used as a case study method with different packet arrival probabilities based on MMBPs with one, two, and four states. The results showed that the proposed model influences the outcomes of AQM methods. Furthermore, it was found that RED might not effectively address network burstiness due to its relatively slow reaction time. As a result, it can be concluded that RED performs optimally only with a single-state model.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| 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".