Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Stability of a tandem of queueing systems with Bernoulli noninstantaneous transfer of customers - MaRDI portal

Stability of a tandem of queueing systems with Bernoulli noninstantaneous transfer of customers (Q2849259)

From MaRDI portal





scientific article; zbMATH DE number 6208772
Language Label Description Also known as
English
Stability of a tandem of queueing systems with Bernoulli noninstantaneous transfer of customers
scientific article; zbMATH DE number 6208772

    Statements

    Stability of a tandem of queueing systems with Bernoulli noninstantaneous transfer of customers (English)
    0 references
    17 September 2013
    0 references
    controlled queueing system
    0 references
    cybernetic approach
    0 references
    nonlocal description of input flow
    0 references
    Markov chain
    0 references
    stationary distribution
    0 references
    0 references
    The paper under review studies two queues in series that serve customers under the following assumptions. There are four independent input flows; two flows arrive in the first system, and other two flows arrive in the second one. Each of these input flows forms non-ordinary Poisson process. The flows are conflicting in the sense that customers arriving from different sources cannot be served simultaneously in the same queue. That is, connected queues with multiple customer classes are studied, and standard techniques of the flows composition are unavailable, since each type of customer in a queue alternatively has a priority. In the paper, this mechanism is called cyclic control algorithm of service, which is motivated as a chain of two crossroads with conflicting traffic regulated with lights. The service times of traffic are assumed generally distributed. By using Markov chain techniques, the author finds a sufficient condition for the existence of the stationary queue-length distributions for the queuing model.
    0 references

    Identifiers