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

From MaRDI portal
Revision as of 18:44, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4288005

DOI10.1080/15326349408807292zbMath0791.60088OpenAlexW2020058659MaRDI 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




Related Items (22)

Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K/SM[K]/1/FCFS Queue] ⋮ Performance analysis of a \(GI-Geo-1\) buffer with a preemptive resume priority scheduling disciplineA UNIFIED QUEUE LENGTH FORMULA FOR BMAP/G/1 QUEUE WITH GENERALIZED VACATIONSEfficient analysis of the MMAP[\(K\)/PH[\(K\)]/1 priority queue] ⋮ Analyzing priority queues with 3 classes using tree-like processesCommuting Matrices in the Queue Length and Sojourn Time Analysis of MAP/MAP/1 QueuesCorrected Phase-Type Approximations of Heavy-Tailed Queueing Models in a Markovian EnvironmentThe FIFO single-server queue with disasters and multiple Markovian arrival streamsAnalysis of queueing systems with customer interjectionsResource optimization in \(MMAP[2/PH[2]/S\) priority queueing model with threshold \(PH\) retrial times and the preemptive resume policy] ⋮ On Ruin Probability for a Risk Process Perturbed by a Lévy Process with no Negative JumpsWaiting time and queue length analysis of Markov-modulated fluid priority queuesAnalysis of a discrete-time preemptive resume priority bufferAnalysis 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 speedMarkov-renewal fluid queuesAnalysis and Computation of the Joint Queue Length Distribution in a FIFO Single-Server Queue with Multiple Batch Markovian Arrival StreamsMatrix Product-Form Solutions for LCFs Preemptive Service Single-Server Queues with Batch Markovian Arrival StreamsThe Waiting Time Distribution of a TypekCustomer in a Discrete-Time MMAP[K/PH[K]/c (c = 1, 2) Queue Using QBDs] ⋮ A Direct Approach to a First-Passage Problem with Applications in Risk TheoryQuasi-birth-and-death Markov processes with a tree structure and the MMAP[K/PH[K]/N/LCFS non-preemptive queue] ⋮ Age process, workload process, sojourn times, and waiting times in a discrete time SM[K/PH[K]/1/FCFS queue]




This page was built for publication: The workload in theMAP/G/1 queue with state-dependent services:its application to a queue with preemptive resume priority