Lattice path approaches for busy period density of \(GI^b/G/1\) queues using \(C_2\) Coxian distributions (Q1001707)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5510781
Language Label Description Also known as
default for all languages
No label defined
    English
    Lattice path approaches for busy period density of \(GI^b/G/1\) queues using \(C_2\) Coxian distributions
    scientific article; zbMATH DE number 5510781

      Statements

      Lattice path approaches for busy period density of \(GI^b/G/1\) queues using \(C_2\) Coxian distributions (English)
      0 references
      0 references
      0 references
      0 references
      24 February 2009
      0 references
      The paper deals with a lattice path approach in analyzing a busy period for non-Markovian queuing systems of \(GI^b/G/1\) type, initially considering \(i_0\) batches of customers. Such queuing systems arise in manufacturing models (e.g. systems with failure states and deadlocks, unstable queuing systems etc.). Lattice path approach has been considered as a reasonable alternative to other methods of transient analysis (e.g. transform solutions, root finding techniques etc.). For, both inter-arrival and service time distributions are approximated by 2-phase Cox distribution \(C_2\) with Markov property. The aim is to provide in computational form the busy period density of a \(GI^b/G/1\) queue, which is practically implementable in real life situations, such as: industrial assembly lines, road traffic flow, communication systems etc.
      0 references
      lattice path approach
      0 references
      busy period analysis
      0 references
      batch arrivals
      0 references
      2-phase Cox distribution \(C_2\)
      0 references
      \(GI^b/G/1\)
      0 references

      Identifiers