Distribution of Processor-Sharing Customers for a Large Closed System with Multiple Classes
From MaRDI portal
DOI10.1137/S0036139998346063zbMATH Open0957.60096MaRDI QIDQ4507239FDOQ4507239
Authors: Arthur W. Berger, Yaakov Kogan 
Publication date: 18 October 2000
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Recommendations
- Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes
- Conditioned Response-Time Distribution for a Large Closed Processor-Sharing System with Multiple Classes in Very Heavy Usage
- Conditioned Response-Time Distribution for a Large Closed Processor-Sharing System in Very Heavy Usage
- Asymptotic analysis of a large closed queueing network with discriminatory processor sharing
- Storage allocation under processor sharing. I: Exact solutions and asymptotics
Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Singular perturbations, turning point theory, WKB methods for ordinary differential equations (34E20)
This page was built for publication: Distribution of Processor-Sharing Customers for a Large Closed System with Multiple Classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4507239)
