A queueing system where customers require a random number of servers simultaneously

DOI10.1016/0377-2217(86)90299-7MaRDI QIDQ1068692zbMATH OpenOpenAlexFDO

Authors B. George

Publication date 1986

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(86)90299-7

zbMATH Keywords

closed single node queueing systemcommunicationsdistribution of busy serversidentical serversmultiple classesperformance measuresqueue-length distributionsingle queuethroughput

Mathematics Subject Classification ID

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

Review text

A closed single node queueing system with multiple classes is analyzed numerically. The node consists of M identical servers fed by a single queue. Each customer of class r, \(1\leq r\leq M\), acquires r servers simultaneously at the beginning of its service. All r servers are released at the same time upon completion of its service. The service time of a class r customer is exponentially distributed with a mean depending on r. This queueing model is analyzed with a view to obtaining performance measures such as throughput, distribution of busy servers, and queue-length distribution.

Recommendations

• Queues in Which Customers Receive Simultaneous Service from a Random Number of Servers: A System Point Approach
• Multiserver Queueing System with Constant Service Time and Simultaneous Service of a Customer by Random Number of Servers
• Queues with customers requiring random number of servers
• An M/G/c queue in which the number of servers required is random
• Technical Note—On Waiting Times for a Queue in Which Customers Require Simultaneous Service from a Random Number of Servers

Cites work

• A Queueing System in Which Customers Require a Random Number of Servers
• An M/G/c queue in which the number of servers required is random
• An embedded level crossing technique for dams and queues
• Comparing Operating Characteristics of Queues in Which Customers Require a Random Number of Servers
• scientific article; zbMATH DE number 3630213 (Why is no real title available?)
• Queues in Which Customers Receive Simultaneous Service from a Random Number of Servers: A System Point Approach
• Technical Note—On Waiting Times for a Queue in Which Customers Require Simultaneous Service from a Random Number of Servers

Cited in

(10)

• Stability criterion of a multiserver model with simultaneous service
• Blocking of finite source inputs which require simultaneous servers with general think and holding times
• Computation and optimization methods for multiresource queues
• The double-space parking problem
• Queueing System with On-Demand Number of Servers
• An N Server Cutoff Priority Queue Where Arriving Customers Request a Random Number of Servers
• A queueing process with the possibility of customers becoming servers
• Closed multiresource queueing systems with controllable priorities
• A multi-layer client–server queueing network model with non-hierarchical synchronous and asynchronous messages
• Multiserver Queueing System with Constant Service Time and Simultaneous Service of a Customer by Random Number of Servers

This page was built for publication: A queueing system where customers require a random number of servers simultaneously

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1068692)