MétaCan
Menu
Back to cohort
Record W2096541983 · doi:10.1287/ijoc.13.3.172.12627

Modeling and Analysis of Discrete-Time Multiserver Queues with Batch Arrivals: GI<sup>X</sup>/Geom/m

2001· article· en· W2096541983 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueINFORMS journal on computing · 2001
Typearticle
Languageen
FieldBusiness, Management and Accounting
TopicAdvanced Queuing Theory Analysis
Canadian institutionsRoyal Military College of Canada
Fundersnot available
KeywordsComputer scienceMarkov chainQueueQueueing theoryBulk queueState (computer science)Observer (physics)Random variableAlgorithmDiscrete time and continuous timeReal-time computingMathematical optimizationMathematicsComputer networkStatistics

Abstract

fetched live from OpenAlex

Multiserver queues are often encountered in telecommunication systems and have special importance in the design of ATM networks. This paper analyzes a discrete-time multiserver queueing system with batch arrivals in which the interbatch and service times are, respectively, arbitrarily and geometrically distributed. Using supplementary-variable and embedded-Markov-chain techniques, the queue is analyzed only for the early arrival system. Since the late arrival system can be discussed similarly, it is not considered here. In addition to developing relations among state probabilities at prearrival, arbitrary, and outside observer's observation epochs, the numerical evaluation of state probabilities is also discussed. It is also shown that, in the limiting case, the relations developed here tend to continuous-time counterparts. Further, the waiting-time distribution of a random customer of a batch is obtained. Finally, in some cases simulation experiments have been performed to validate our results.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.065
Threshold uncertainty score0.917

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.002
Science and technology studies0.0000.000
Scholarly communication0.0000.002
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.013
GPT teacher head0.245
Teacher spread0.232 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it