Skip to Main content Skip to Navigation
Journal articles

IPA for Continuous Stochastic Marked Graphs

Abstract : This paper presents a unified framework for the Infinitesimal Perturbation Analysis (IPA) gradient-estimation technique in the setting of marked graphs. It proposes a systematic approach for computing the derivatives of sample performance functions with respect to structural and control parameters. The resulting algorithms are recursive in both time and network flows, and their successive steps are computed in response to the occurrence and propagation of certain events in the network. Such events correspond to discontinuities in the network flow-rates, and their special characteristics are due to the properties of continuous transitions and fluid places. Following a general outline of the framework we focus on a simple yet canonical example, and investigate throughput and workload-related performance criteria as functions of structural and control variables. Simulation experiments support the analysis and testify to the potential viability of the proposed approach.
Document type :
Journal articles
Complete list of metadata
Contributor : William Domingues Vinhas Connect in order to contact the contributor
Submitted on : Tuesday, February 28, 2017 - 8:57:20 PM
Last modification on : Tuesday, October 19, 2021 - 10:59:52 PM



yorai Wardi, Alessandro Giua, Carla Seatzu. IPA for Continuous Stochastic Marked Graphs. Automatica, Elsevier, 2013, 49 (5), pp.1204-1215. ⟨10.1016/j.automatica.2013.02.006⟩. ⟨hal-01479647⟩



Record views