An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas

DOI10.1016/0305-0548(89)90023-3zbMath0668.90030OpenAlexW2080486549MaRDI QIDQ1118524

André B. Bondi

Publication date: 1989

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(89)90023-3

zbMATH Keywords

finite capacity queueresponse timessteady state probabilitiescomputer communication systemsexponential service

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas ⋮ Randomized pushing-out in the priority queueing with a finite buffer size

Cites Work

• Unnamed Item
• Unnamed Item
• Analysis of a finite capacity non preemptive priority queue
• Finite capacity priority queues with potential health applications
• An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas
• Priority queues
• Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions
• Solution of Queuing Problems by a Recursive Technique
• Buffer Management in a Packet Switch
• Priority Assignment in Waiting Line Problems
• Letter to the Editor—Priority Assignment—A Correction

This page was built for publication: An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas