A recursive equations based representation for the $G/G/m$ queue

Abstract

New recursive equations designed for the G/G/m queue are presented. These equations describe the queue in terms of recursions for the arrival and departure times of customers, and involve only the operations of maximum, minimum and addition.

References in corpus (1)

• Unbiased estimates for gradients of stochastic network performance measures

Cited by in corpus (1)

• Unbiased gradient estimation in queueing networks with parameter-dependent routing