IP Traffic Matrix Estimation Methods: Comparisons and Improvements
Bibliographic record
Abstract
Determining point to point traffic matrix is essential for Internet service providers (ISPs) in carrying out traffic engineering tasks for network management and planning purposes. However, it is very difficult and costly to measure this traffic matrix directly. Hence, traffic matrices are inferred from link measurements through estimation, using different techniques. There are different techniques for this traffic matrix estimation and there is still a need for evaluating these existing techniques. Some of those techniques have been previously compared, but with new improved techniques recently developed there is a need to revisit the comparisons. In this paper, we have carried out studies to compare three very popular methods: the tomogravity, the entropy maximization and linear programming methods. We find that the tomogravity method best estimates the traffic matrix among the methods we tested. We then incorporate some enhancements which improve this method. Specifically we established that knowing some point to point traffic may improve the estimation but not necessarily, and this is counter-intuitive. We modify the existing entropy maximization method by adding more constraints and we find that our modified method outperforms the existing entropy maximization and tomogravity methods.
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.009 | 0.035 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.004 | 0.003 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.004 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".