The \(M/G/1\) processor-sharing queue with disasters

DOI10.1016/j.camwa.2005.10.012zbMath1180.90072OpenAlexW2078714075MaRDI QIDQ2475887

Chuang Lin, Quan-Lin Li

Publication date: 11 March 2008

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2005.10.012

zbMATH Keywords

sojourn timesupplementary variable methoddisasterprocessor-sharing queuenegative customer

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (7)

On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes ⋮ The \(N\)-policy for an unreliable server with delaying repair and two phases of service ⋮ Unnamed Item ⋮ The optimal control of an unreliable server queue with two phases of service and Bernoulli vacation schedule ⋮ An \(M/G/1\) queue with two phases of service subject to the server breakdown and delayed repair ⋮ Insensitivity of the mean field limit of loss systems under SQ(d) routeing ⋮ A note on application of the method of supplementary variables to the analysis of a processor sharing system

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Processor-sharing queues: Some progress in analysis
• Mathematical problems in the theory of processor-sharing queueing systems
• The M/G/1 processor-sharing model: Transient behavior
• Sojourn time distribution in a MAP/M/1 processor-sharing queue
• \(G\)-networks: A versatile approach for work removal in queueing networks
• Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
• Response times in gated M/G/1 queues: The processor-sharing case
• A \(MAP/G/1\) queue with negative customers
• SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
• A Pollaczek–Khintchine formula for M/G/1 queues with disasters
• A new approach to the M/G/1 processor-sharing queue
• Conditional response times in the M/G/1 processor-sharing system
• 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
• The M/G/1 processor sharing queue as the almost sure limit of feedback queues
• Product-form queueing networks with negative and positive customers
• 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
• On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes
• GI/G/1 processor sharing queue in heavy traffic
• Computation of the limiting distribution in queueing systems with repeated attempts and disasters
• The M/G/1 queue with negative customers
• A BMAP/SM/1 queueing system with Markovian arrival input of disasters
• Analysis of A time‐shared processor
• AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
• Time-shared Systems
• Waiting Time Distributions for Processor-Sharing Systems

This page was built for publication: The \(M/G/1\) processor-sharing queue with disasters