Computational analysis of single-server bulk-arrival queues \(M^ X/G/1\) (Q1100086): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5185813 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Iterative Algorithms for Bulk Arrival, Bulk Service Queues with Poisson and Non-Poisson Arrivals / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3911628 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3227941 / rank | |||
Normal rank | |||
Revision as of 15:32, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational analysis of single-server bulk-arrival queues \(M^ X/G/1\) |
scientific article |
Statements
Computational analysis of single-server bulk-arrival queues \(M^ X/G/1\) (English)
0 references
1988
0 references
This paper studies numerically the bulk-arrival queueing model \(M^ x/G/1\). For a special service-time distribution, an algorithm for the limiting distribution of the number in the system at random epoch is developed. This is also used to find the limiting distribution of the number in the system at pre-arrival and post-departure epochs. The mean and standard deviation of these distributions are also computed. Four cases of the service-time distribution are discussed: hyperexponential, deterministic, uniform and Erlang.
0 references
bulk-arrival queueing model
0 references
limiting distribution
0 references
number in the system at random epoch
0 references
number in the system at pre-arrival and post-departure epochs
0 references
service-time distribution
0 references
0 references
