Transient analysis of queues with heterogeneous arrivals

DOI10.1007/BF01158773zbMath0806.60083MaRDI QIDQ1339094

Walter Böhm, Sri Gopal Mohanty

Publication date: 14 February 1995

Published in: Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

weak convergencelattice path enumerationdiscrete time queueing modellattice path representation

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (5)

Distribution of number served during a busy period of GI/M/1/N queues: Lattice path approach ⋮ Lattice path approach to transient analysis of M/G/1/N non-Markovian queues using Cox distributions ⋮ Lattice path counting and the theory of queues ⋮ Lattice paths combinatorics applied to transient queue length distribution of C\(_2/\)M/1 queues and busy period analysis of bulk queues C\(_2^b/\)M/1 ⋮ On Stochastic Predictions of Failure Processes Under Population Heterogeneity

Cites Work

• Unnamed Item
• Unnamed Item
• Multiprocessor systems with reserves and preferences
• The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach
• Lattice path approach to transient solution of \(M/M/1\) with (\(0,k\)) control policy
• Combinatorial approach to Markovian queueing models
• Some Generalizations of Vandermonde's Convolution
• On queues involving batches

This page was built for publication: Transient analysis of queues with heterogeneous arrivals