The Conditional Sojourn Time Distribution in the GI/M/1 Processor-Sharing Queue in Heavy Traffic

DOI10.1137/0153057zbMath0785.60044OpenAlexW2233574123MaRDI QIDQ3142786

Yongzhi Yang, Charles Knessl

Publication date: 17 April 1994

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

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

zbMATH Keywords

asymptotic expansionsconditional momentssingular perturbation techniquesprocessor-sharingexpected sojourn time

Mathematics Subject Classification ID

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

Related Items (1)

AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue

This page was built for publication: The Conditional Sojourn Time Distribution in the GI/M/1 Processor-Sharing Queue in Heavy Traffic