Inequalities for Charlier polynomials with application to teletraffic theory (Q1105292)

From MaRDI portal
Revision as of 16:59, 18 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers