Asymptotic analysis of a large closed queueing network with discriminatory processor sharing

DOI10.1007/BF01158797zbMath0727.60106OpenAlexW2062646768MaRDI QIDQ803669

John A. Morrison

Publication date: 1991

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01158797

zbMATH Keywords

asymptotic approximationheavy trafficqueueing networkmean sojourn timesteady-state behavior

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (3)

A decomposition theorem and related results for the discriminatory processor sharing queue ⋮ A survey on discriminatory processor sharing ⋮ Discriminatory Processor Sharing Queues and the DREB Method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complete parameterized families of job scheduling strategies
• Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes
• 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
• Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers
• The Distribution of Queuing Network States at Input and Output Instants
• A Class of Closed Markovian Queuing Networks: Integral Representations, Asymptotic Expansions, and Generalizations*
• Sharing a Processor Among Many Job Classes
• Time-shared Systems

This page was built for publication: Asymptotic analysis of a large closed queueing network with discriminatory processor sharing