Blocking When Service Is Required From Several Facilities Simultaneously

Abstract

This paper analyzes a mathematical model of a blocking system with simultaneous resource possession. There are several multiserver service facilities without extra waiting space at which several classes of customers arrive in independent Poisson processes. Each customer requests service from one server in each facility in a subset of the service facilities, with the subset depending on the customer class. If service can be provided immediately upon arrival at all required facilities, then service begins and all servers assigned to the customer start and finish together. Otherwise, the attempt is blocked (lost without generating retrials). The problem is to determine the blocking probability for each customer class. An exact expression is available, but it is complicated. Hence, this paper investigates approximation schemes.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 293 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.