Stationary Blocking Probability in Multi-server Finite Queuing System with Ordered Entry and Poisson Arrivals

DOI10.1007/978-3-319-30843-2_36zbMath1390.90253OpenAlexW2462642103MaRDI QIDQ4568366

Rostislav Razumchik, Ivan Zaryadov

Publication date: 21 June 2018

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30843-2_36

zbMATH Keywords

finite capacityblocking probabilityqueuing systemordered entry

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (2)

Ergodicity bounds for the Markovian queue with time-varying transition intensities, batch arrivals and one queue skipping policy ⋮ Stationary Distribution of Discrete-Time Finite-Capacity Queue with Re-sequencing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a two-server finite queueing system with ordered entry and deterministic arrivals
• Comparing ordered-entry queues with heterogeneous servers
• Convexity properties of the overflow in an ordered-entry system with heterogeneous servers
• Analysis of \(GI/ M/ n/ n\) queueing system with ordered entry and no waiting line
• ANALYSIS OF FINITE CAPACITY QUEUE WITH NEGATIVE CUSTOMERS AND BUNKER FOR OUSTED CUSTOMERS USING CHEBYSHEV AND GEGENBAUER POLYNOMIALS
• A note on many-server queueing systems with ordered entry, with an application to conveyor theory
• On the Overflow Process from a Finite Markovian Queue
• Server utilization factors in queueing loss systems with ordered entry and heterogeneous servers
• Approximating a Point Process by a Renewal Process, I: Two Basic Methods
• On a Multichannel Queueing System with Semi-Ordered Entry
• Complementary generating functions for theM^X/GI/1/kandGI/M^y/1/Kqueues and their application to the comparison of loss probabilities

This page was built for publication: Stationary Blocking Probability in Multi-server Finite Queuing System with Ordered Entry and Poisson Arrivals