Markov Processes Representing Traffic in Connecting Networks
From MaRDI portal
Cited in
(6)- Brownian models of multiclass queueing networks: Current status and open problems
- Analysis of a stochastic multiplexer with generalized periodic sources
- Calculating the \(M/G/1\) busy-period density and LIFO waiting-time distribution by direct numerical transform inversion
- Queueing theory
- Dynamic programming and optimal control of variable multichannel stochastic service systems with applications
- 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
This page was built for publication: Markov Processes Representing Traffic in Connecting Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5329515)