Parallel sample path generation for discrete event systems and the traffic smoothing problem

DOI10.1007/BF01439040zbMath0846.93055OpenAlexW1992512128MaRDI QIDQ1901409

Christos G. Cassandras, Jie Pan

Publication date: 14 November 1995

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

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

zbMATH Keywords

optimizationsmoothingdiscrete event systemstraffic processesaugmented system analysissample path constructabilitystandard clock approach

Mathematics Subject Classification ID

Perturbations in control/observation systems (93C73) Data smoothing in stochastic control theory (93E14) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items (1)

Optimal \((0, 1)\)-matrix completion with majorization ordered objectives

Cites Work

• Unnamed Item
• Unnamed Item
• A new approach to the analysis of discrete event dynamic systems
• Analysis and design of rate-based congestion control of high speed networks. I: Stochastic fluid models, access regulation
• Perturbation analysis and optimization of queueing networks
• Using a standard clock technique for efficient simulation
• Ordinal optimization of DEDS
• Burst reduction properties of rate-control throttles: Departure process
• Infinitesimal perturbation analysis of a queueing system with bursty traffic
• Observable augmented systems for sensitivity analysis of Markov and semi-Markov processes
• On-line sensitivity analysis of Markov chains
• The impact of a job buffer in a token-bank rate-control throttle
• Uniformization and Hybrid Simulation/Analytic Models of Renewal Processes
• Inequalities: theory of majorization and its applications

This page was built for publication: Parallel sample path generation for discrete event systems and the traffic smoothing problem