Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes

DOI10.2307/1427058zbMath0556.60038OpenAlexW2319232349MaRDI QIDQ3219544

Debasis Mitra, John A. Morrison

Publication date: 1985

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1427058

zbMATH Keywords

asymptotic approximationprocessor-sharing disciplineclosed queueing networksequilibrium waiting time

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (12)

Processor-sharing queues: Some progress in analysis ⋮ On spectral properties of finite population processor shared queues ⋮ Sojourn time distribution in some processor-shared queues ⋮ Asymptotic Analysis of Spectral Properties of Finite Capacity Processor Shared Queues ⋮ The Unconditional Sojourn Time Distribution in the Queue GI/M/1‐K with Processor Sharing Service ⋮ The equivalence between processor sharing and service in random order. ⋮ Mathematical theory of queueing networks ⋮ A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ Sojourn time asymptotics in processor-sharing queues ⋮ Asymptotic analysis of a large closed queueing network with discriminatory processor sharing ⋮ Asymptotic analysis for closed multiclass queueing networks in critical usage

This page was built for publication: Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes