Marked Markovian arrivals in a tandem G-network with blocking
From MaRDI portal
Publication:1041300
DOI10.1007/S11009-008-9080-8zbMath1234.60091OpenAlexW2094647858MaRDI QIDQ1041300
Publication date: 2 December 2009
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11009-008-9080-8
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(G\)-networks: A unifying model for neural and queueing networks
- Approximate analysis of discrete-time tandem queueing networks with bursty and correlated input traffic and customer loss
- Stability conditions of the MMAP[\(K\)/\(G\)[\(K\)]/1/LCFS preemptive repeat queue]
- Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K/PH[K]/N/LCFS non-preemptive queue]
- \(G\)-networks: A versatile approach for work removal in queueing networks
- A tandem queue with blocking and Markovian arrival process
- \(G\)-networks: development of the theory of multiplicative networks
- Markov chains with marked transitions
- Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K/SM[K]/1/FCFS Queue]
- A single-server queue with server vacations and a class of non-renewal arrival processes
- Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking
- Product-form queueing networks with negative and positive customers
- A Queueing Model with Finite Waiting Room and Blocking
- Finite Capacity Queuing Systems with Applications in Computer Modeling
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- A logarithmic reduction algorithm for quasi-birth-death processes
- Decomposition of general tandem queueing networks with MMPP input
- On a tandem G-network with blocking
- A QUEUE WITH POSITIVE AND NEGATIVE ARRIVALS GOVERNED BY A MARKOV CHAIN
- Numerical Inversion of Laplace Transforms of Probability Distributions
- Queues with marked customers
- Marked point processes as limits of Markovian arrival streams
- Numerical Methods for Structured Markov Chains
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- An analytical solution for a tandem queue with blocking
- Analysis of queueing networks with blocking
- The versatility of MMAP[K and the MMAP[K]/G[K]/1 queue]
This page was built for publication: Marked Markovian arrivals in a tandem G-network with blocking