Strong Consistency of Infinitesimal Perturbation Analysis for Networks with Correlated Service Times

The paper will concern strong consistency of infinitesimal perturbation analysis (IPA) for a class of queueing networks with correlated service times. The networks are assumed to have a single class of customers, and service times with bounded density functions. Strong consistency will be discussed in terms of a set of sufficient conditions, recently established by the authors [1]. The conditions will be verified for sojourn times in serial and tree-shaped networks, and for an approximate measure of the threshold delay-probability in serial networks.