The workload in theMAP/G/1 queue with state-dependent services:its application to a queue with preemptive resume priority

DOI10.1080/15326349408807292zbMath0791.60088MaRDI QIDQ4288005

Tetsuya Takine, Toshiharu Hasegawa

Publication date: 7 July 1994

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349408807292

zbMATH Keywords

first passage time; mean waiting time; semi-Markovian arrival processes; state-dependent service time distributions; waiting time of customers

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

Related Items

Analysis and Computation of the Joint Queue Length Distribution in a FIFO Single-Server Queue with Multiple Batch Markovian Arrival Streams, The Waiting Time Distribution of a TypekCustomer in a Discrete-Time MMAP[K/PH[K]/c (c = 1, 2) Queue Using QBDs], Markov-renewal fluid queues, A UNIFIED QUEUE LENGTH FORMULA FOR BMAP/G/1 QUEUE WITH GENERALIZED VACATIONS, Matrix Product-Form Solutions for LCFs Preemptive Service Single-Server Queues with Batch Markovian Arrival Streams, Efficient analysis of the MMAP[\(K\)/PH[\(K\)]/1 priority queue], The FIFO single-server queue with disasters and multiple Markovian arrival streams, Analyzing priority queues with 3 classes using tree-like processes, Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K/PH[K]/N/LCFS non-preemptive queue], Analysis of a continuous time SM[K/PH[K]/1/FCFS queue: age process, sojourn times, and queue lengths], Single-server queues with Markov-modulated arrivals and service speed, Performance analysis of a \(GI-Geo-1\) buffer with a preemptive resume priority scheduling discipline, Analysis of queueing systems with customer interjections, Waiting time and queue length analysis of Markov-modulated fluid priority queues, Analysis of a discrete-time preemptive resume priority buffer, Age process, workload process, sojourn times, and waiting times in a discrete time SM[K/PH[K]/1/FCFS queue], Commuting Matrices in the Queue Length and Sojourn Time Analysis of MAP/MAP/1 Queues, Corrected Phase-Type Approximations of Heavy-Tailed Queueing Models in a Markovian Environment, A Direct Approach to a First-Passage Problem with Applications in Risk Theory, Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K/SM[K]/1/FCFS Queue], On Ruin Probability for a Risk Process Perturbed by a Lévy Process with no Negative Jumps