Sojourn time distribution in a MAP/M/1 processor-sharing queue
From MaRDI portal
Publication:1400353
DOI10.1016/S0167-6377(03)00028-2zbMath1025.60040OpenAlexW2000321463MaRDI QIDQ1400353
Hiroyuki Masuyama, Tetsuya Takine
Publication date: 13 August 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(03)00028-2
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (12)
An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue ⋮ Sojourn Time Analysis for Processor Sharing Loss Queuing System with Service Interruptions and MAP Arrivals ⋮ Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline ⋮ Processor sharing: a survey of the mathematical theory ⋮ A retrial queueing system with processor sharing ⋮ Analysis of MAP/M/1 queue with working breakdowns ⋮ The \(M/G/1\) processor-sharing queue with disasters ⋮ Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals ⋮ Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates ⋮ Analysis of a MAP/PH/1 Queue with Discretionary Priority Based on Service Stages ⋮ Discriminatory Processor Sharing Queues and the DREB Method ⋮ AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
Cites Work
- The equivalence between processor sharing and service in random order.
- The sojourn time in the GI/M/1 queue by processor sharing
- The sojourn-time distribution in the M/G/1 queue by processor sharing
- Response-Time Distribution for a Processor-Sharing System
- A single-server queue with server vacations and a class of non-renewal arrival processes
- On processor sharing and random service
- The gi/m/1 processor-sharing queue and its heavy traffic analysis
- An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
- GI/G/1 processor sharing queue in heavy traffic
- Marked point processes as limits of Markovian arrival streams
- Waiting Time Distributions for Processor-Sharing Systems
- Analysis of the M/M/1 queue with processor sharing via spectral theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sojourn time distribution in a MAP/M/1 processor-sharing queue