Finite-Buffer Bulk Service Queue Under Markovian Service Process: <i>GI</i> / <i>MSP</i> <sup> ( <i>a</i> , <i>b</i> ) </sup> /1/ <i>N</i>
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract We consider a single-server queue with renewal input and Markovian service process where server serves customers in batches according to a general bulk service rule. Queue length distributions at pre-arrival and arbitrary epochs have been obtained along with some important performance measures such as probability of blocking, mean queue lengths and mean waiting times. The analysis has been carried out assuming finite-buffer space for the arriving customers. The model has potential applications in areas such as computer networks, telecommunication systems and manufacturing systems. Keywords: Finite-bufferGeneral bulk service ruleGeneral independent arrivalMarkovian service processMathematics Subject Classification: Primary 60K25Secondary 90B22, 68M20 Acknowledgments A preliminary version of this article appeared in Proceedings of the 2nd International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2007, Nantes, France, October 22–27, Article No. 55. (ACM International Conference Proceeding Series; Vol. 321). The authors would like to thank the referee for his valuable comments and suggestions which helped to improve the presentation of this article.
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.
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.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.017 |
| Science and technology studies | 0.002 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 it