IPA for Continuous Stochastic Marked Graphs

Yorai Wardi (1) , Alessandro Giua (2) , Carla Seatzu (3)

1 ECE GeorgiaTech - School of Electrical and Computer Engineering - Georgia Insitute of Technology
2 DIEE - Department of Electrical and Electronic Engineering [University of Cagliari]
3 LSIS - Laboratoire des Sciences de l'Information et des Systèmes

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.

Domaines: Automatique

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