Consideration was given to the discrete-time MAP/G/1/∞ queuing system where the arriving customer is taken to the server with a certain probability depending only of the processed length of the customer in service and squeezes out its predecessor to the first place on the queue or, with the complementary probability, occupies the first place on the queue (inversive probabilistic servicing discipline). For this system, the main stationary operational characteristics were established.
Discrete-Time MAP/G/1/∞ System with InversiveProbabilistic Servicing Discipline
CASCONE, ANNUNZIATA;MANZO, Rosanna;SALERNO, Saverio
2010
Abstract
Consideration was given to the discrete-time MAP/G/1/∞ queuing system where the arriving customer is taken to the server with a certain probability depending only of the processed length of the customer in service and squeezes out its predecessor to the first place on the queue or, with the complementary probability, occupies the first place on the queue (inversive probabilistic servicing discipline). For this system, the main stationary operational characteristics were established.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
