A discrete-time single server queue with a two-level modulated input and its applications
Bibliographic record
Abstract
A discrete-time, single-server system with a two-level modulated input is considered. The time axis is divided into equal-length slots, and the service time is deterministic and equal to one slot. The probability-generating function of the number of calls in the system is derived. A special case of this queuing system with a two-level Markov modulated Poisson input is studied in detail. Some numerical results concerning the mean and the variance of waiting time of an arbitrary call are given. The MMPP (Markov modulated Poisson process) approach is used to study some cases other than that of the packetized voice system. An alternative to the determination of the four parameters of the MMPP is also presented. This approach produces better results than the method presented for the cases with long burst length and high source peak rate (broadband integrated services digital network). This queuing model can be applied to performance analysis of a discrete-time ATM (asynchronous transfer mode) system and can be used as an approximation for a continuous-time MMPP/D/1 system.>
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.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".