Smoothed perturbation analysis algorithms for estimating the derivatives of occupancy-related functions in serial queueing networks

DOI10.1007/BF02060945zbMath0764.60094OpenAlexW1552416183MaRDI QIDQ1207849

Wei-Bo Gong, M. H. Kallmes, Christos G. Cassandras, Yoraï Wardi

Publication date: 16 May 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02060945

zbMATH Keywords

performance measuresinfinitesimal perturbation analysissmoothed perturbation analysisserial queueing networksoccupancy-related functions

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (2)

Modeling and optimization of M/G/1-type queueing networks: an efficient sensitivity analysis approach ⋮ Smoothing complements and randomized score functions

Cites Work

• Unnamed Item
• Infinitesimal and finite perturbation analysis for queueing networks
• Smoothed perturbation analysis for a class of piecewise constant sample performance functions
• Realization probability in closed Jackson queueing networks and its application
• Performance evaluation and perturbation analysis of discrete event dynamic systems
• Smoothed (conditional) perturbation analysis of discrete event dynamical systems
• A Sample Performance Function of Closed Jackson Queueing Networks
• Structural Conditions for Perturbation Analysis Derivative Estimation: Finite-Time Performance Indices
• Smoothed perturbation analysis for a class of discrete-event systems

This page was built for publication: Smoothed perturbation analysis algorithms for estimating the derivatives of occupancy-related functions in serial queueing networks