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

This paper considers a discrete event systems problem called the sample path constructability problem. That is, for a finite discrete parameter set, given a sample path under the first parameter, simultaneously construct sample paths under all remaining parameter values. Two approaches have evolved for this problem: one called the standard clock approach, and one called augmented system analysis. The paper reviews these two approaches and places them in the context of the sample path constructability problem. The paper then applies the augmented system analysis approach to smoothing of traffic processes. Traffic smoothing is an important class of problems, which is receiving widespread attention. This paper facilitates on-line control and optimization, and as such is a particularly important contribution. The paper is highly readable, and the authors have taken great pains to explain their concepts clearly. This paper presents an immense amount of work in a simple fashion, and it is highly recommended.