Blocking probabilities for multiple class batched Poisson arrivals to a shared resource

DOI10.1016/0166-5316(94)00042-5zbMATH Open0875.68259OpenAlexW2078198013WikidataQ127217855 ScholiaQ127217855MaRDI QIDQ4332097FDOQ4332097

Authors: John A. Morrison 

Publication date: 27 February 1997

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(94)00042-5

Recommendations

• Blocking in a shared resource environment with batched Poisson arrival processes
• A critically loaded multiclass Erlang loss system
• scientific article; zbMATH DE number 956810
• Blocking probabilities for large multirate erlang loss systems

zbMATH Keywords

Blocking probabilitiesBatched arrivalsMultiple classesShared resourceUniform asymptotic approximation

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cited In (8)

• Heavy-Traffic Approximations for Service Systems With Blocking
• Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation
• Blocking with retrials in a completely shared resource environment
• Blocking in a shared resource environment with batched Poisson arrival processes
• Loss tandem networks with blocking -- a semi-Markov approach
• On providing blocking probability and throughput guarantees in a multi-service environment
• MULTI-CLASS RESOURCE SHARING WITH BATCH ARRIVALS
• MAXIMUM BLOCKING PROBABILITY IN GI/GI/cc SYSTEMS WITH BURSTY ARRIVALS

This page was built for publication: Blocking probabilities for multiple class batched Poisson arrivals to a shared resource

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