A \(MAP/G/1\) queue with negative customers
From MaRDI portal
Publication:1876053
DOI10.1023/B:QUES.0000032798.65858.19zbMath1048.60073MaRDI QIDQ1876053
Publication date: 16 August 2004
Published in: Queueing Systems (Search for Journal in Brave)
supplementary variable method; heavy tail; light tail; matrix-analytic method; Markovian arrival process (MAP); RG-factorization; censoring technique; queue with negative customers; Markov chains of \(GI/G/1\) type; Markov renewal processes of \(M/G/1\) type
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
Related Items
Markov and Non-Markov Probabilistic Models of Interacting Flows of Annihilating Particles, An \(M/G/1\) \(G\)-queue with server breakdown, working vacations and vacation interruption, \(LU\)-factorization versus Wiener-Hopf factorization for Markov chains, Discrete-time GI\(^X\)/Geo/1/N queue with negative customers and multiple working vacations, Identifiability of the \(\mathrm{MAP}_2/\mathrm{G}/1\) queueing system, Analysis of G-queue with unreliable server, Analysis of the finite source MAP/PH/N retrial \(G\)-queue operating in a random environment, On the BMAP/G/1 G-queues with second optional service and multiple vacations, An \(MAP/G/1\) \(G\)-queues with preemptive resume and multiple vacations, Multi-server queueing system with a batch Markovian arrival process and negative customers, A \(GI/Geo/1\) queue with negative and positive customers, On a BMAP/G/1 G-queue with setup times and multiple vacations, The \(M/G/1\) processor-sharing queue with disasters, On bulk-service MAP/PH\(^{L,N}\)/1/N G-queues with repeated attempts, On a discrete-time \(GI^X Geo/1/N-G\) queue with randomized working vacations and at most \(J\) vacations, Diffusion Approximation of State-Dependent G-Networks Under Heavy Traffic