Performance of weighted fair queuing systems with long range dependent traffic inputs
Bibliographic record
Abstract
This paper provides an analytical technique for estimating the queue length distributions for a weighted fair queue (WFQ) system fed with long range dependent (LRD) traffic input. The analysis considers the coupling between the queues of the WFQ system due to the dependency of the queue length on the weights and input traffic of other queues. It is also applicable to short range dependent (SRD) traffic sources. With aggregate LRD traffic streams represented by multi-scale wavelet models (MWM), the analysis starts by modeling each queue of a WFQ system as an MWM/D/1 queue and multi-scale queuing (MSQ) is used to estimate the queue length distribution. Each queue unused capacity is evaluated and an extension of our previous work on priority queuing of LRD traffic is used to provide an MWM model for the service rate of each queue and decompose the WFQ queues into MWM/MWM/1 queues. Subsequently, this MWM/MWM/1 decomposition is used to examine the queue length distribution. The accuracy of the proposed analytical technique is examined by comparing queue survivor functions obtained analytically to those directly measured from event-driven simulations for various traffic conditions and WFQ weight configurations. The analysis shows the effect of both weight variation and traffic self-similarity on the queue length distribution of each queue. Analytical and simulation results show that the proposed analytical technique can provide an accurate estimation of queue length distribution, and can be useful in optimal choices of WFQ weights.
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.000 | 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.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".