Inequalities for Charlier polynomials with application to teletraffic theory (Q1105292): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5824493 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Congestion in Blocking Systems-A Simple Approximation Technique / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some Properties of the Erlang Loss Function / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3737168 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the continued Erlang loss function / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5624248 / rank | |||
Normal rank | |||
Latest revision as of 16:59, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inequalities for Charlier polynomials with application to teletraffic theory |
scientific article |
Statements
Inequalities for Charlier polynomials with application to teletraffic theory (English)
0 references
1988
0 references
The service system studied is a Brockmeyer system, which consists of two finite groups of servers without waiting positions. Customers arrive at the first group according to a Poisson process and customers overflowing the first group are routed to the second group; customers overflowing the second group are lost. Service times are mutually independent and exponentially distributed. Based on a number of inequalities for ratios of Charlier polynomials, simple and accurate bounds are obtained for the equilibrium time congestion of the second group.
0 references
overflow model
0 references
teletraffic theory
0 references
groups of servers without waiting positions
0 references
Charlier polynomials
0 references
