Smoothed perturbation analysis for queues with finite buffers

DOI10.1007/BF01153526zbMath0780.60089OpenAlexW2019339760MaRDI QIDQ688647

M. C. Fu

Publication date: 30 January 1994

Published in: Queueing Systems (Search for Journal in Brave)

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

zbMATH Keywords

simulationperformance measuresperturbation analysissample path analysisregenerative properties

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (2)

Smoothed perturbation analysis derivative estimation for Markov chains ⋮ Perturbation analysis of discrete event systems: Concepts, algorithms, and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strongly Consistent Steady-State Derivative Estimates
• Smoothed (conditional) perturbation analysis of discrete event dynamical systems
• Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 Queue
• Extensions of infinitesimal perturbation analysis
• A Sample Performance Function of Closed Jackson Queueing Networks
• On-line sensitivity analysis of Markov chains
• Structural Conditions for Perturbation Analysis Derivative Estimation: Finite-Time Performance Indices
• Extensions and generalizations of smoothed perturbation analysis in a generalized semi-Markov process framework
• Smoothed perturbation analysis for a class of discrete-event systems

This page was built for publication: Smoothed perturbation analysis for queues with finite buffers