Maximum entropy and the G/G/1/N queue (Q1067967): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Nonpriority Multiprogramming Systems Under Heavy Demand Conditions—Customers' Viewpoint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mathematical analysis of the computer system modeled as a two stage cyclic queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steady-State Queueing Time Distribution for the <i>M</i>/<i>G</i>/1 Finite Capacity Queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: The behaviour of a single queue in a general queueing network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prior Probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3903835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4176949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maximum entropy analysis of the M/G/1 and G/M/1 queueing systems at equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximations for Queues, III: Mixtures of Exponential Distributions / rank
 
Normal rank

Revision as of 10:02, 17 June 2024

scientific article
Language Label Description Also known as
English
Maximum entropy and the G/G/1/N queue
scientific article

    Statements

    Maximum entropy and the G/G/1/N queue (English)
    0 references
    1986
    0 references
    A new ''hybrid'' analytic framework, based on the principle of maximum entropy, is used to derive a closed form expression for the queue length distribution of a G/G/1 finite capacity queue. It is shown that ''Birth- Death'' homogeneous recursions for a single resource queue are a special case of maximum entropy ''one-step'' transitions which can be applied either in an operational or stochastic context. Furthermore, an ''equivalence'' relationship is used to analyse two-stage cyclic queueing networks with general service times, and favourable comparisons are made with global balance and approximative results. Numerical examples provide useful information on how critically system behaviour is affected by the distributional form interarrival and service patterns. Comments on the implication of the work to the performance analysis and aggregation of computer systems are included.
    0 references
    maximum entropy
    0 references
    closed form expression
    0 references
    queue length distribution
    0 references
    G/G/1 finite capacity queue
    0 references
    two-stage cyclic queueing networks
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references