A Finite Capacity PS Queue Which Models Switching Times

DOI10.1137/0153029MaRDI QIDQ5286329zbMATH OpenOpenAlexFDO

Authors Xiaoming Tan, Charles Knessl

Publication date 29 June 1993

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0153029

zbMATH Keywords

asymptoticsprocessor sharing queuesojourn time

Mathematics Subject Classification ID

Singular perturbations, turning point theory, WKB methods for ordinary differential equations (34E20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Recommendations

• On sojourn times in the finite capacity \(M/M/1\) queue with processor sharing
• On the sojourn time distribution in a finite capacity processor shared queue
• Asymptotic Analysis for a Closed Processor-Sharing System with Switching Times: Normal Usage
• On Finite Capacity Processor-Shared Queues
• A Processor-Shared Queue That Models Switching Times: Normal Usage

Cited in

(2)

• Dynamic sorting of calls in systems with limited sojourn time
• Asymptotic Analysis of A Backward-Forward Parabolic Problem for Data-Handling Systems

This page was built for publication: A Finite Capacity PS Queue Which Models Switching Times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286329)