A tandem \(\text{BMAP}/G/1 \to \bullet/M/N/0\) queue with group occupation of servers at the second station (Q1954656): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58911432, #quickstatements; #temporary_batch_1712612547801
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Connection-wise end-to-end performance analysis of queueing networks with MMPP inputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of general tandem queueing networks with MMPP input / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the single server queue with a batch markovian arrival process / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tandem queue with blocking and Markovian arrival process / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a tandem G-network with blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sojourn times in a two-stage queueing network with blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: A. B. Clarke's Tandem Queue Revisited—Sojourn Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692768 / rank
 
Normal rank

Latest revision as of 11:52, 6 July 2024

scientific article
Language Label Description Also known as
English
A tandem \(\text{BMAP}/G/1 \to \bullet/M/N/0\) queue with group occupation of servers at the second station
scientific article

    Statements

    A tandem \(\text{BMAP}/G/1 \to \bullet/M/N/0\) queue with group occupation of servers at the second station (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 June 2013
    0 references
    Summary: We consider a two-stage tandem queue with single-server first station and multiserver second station. Customers arrive to Station 1 according to a batch Markovian arrival process (BMAP). A batch may consist of heterogeneous customers. The type of a customer is determined upon completion of a service at Station 1. The customer's type is classified based on the number of servers required to process the request of the customer at Station 2. If the required number of servers is not available, the customer may leave the system forever or block Station 1 by waiting for the required number of servers. We determine the stationary distribution of the system states at embedded epochs and derive the Laplace-Stieltjes transform of the sojourn time distribution. Some key performance measures are calculated, and illustrative numerical results are presented.
    0 references

    Identifiers