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

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.