Stability of Fluid Queueing Systems with Parallel Servers and Stochastic Capacities
Name
1604.02008.pdf
Size
477.49 KB
Format
Adobe PDF
Checksum (MD5)
b0fabd1f7580d204031daf84285d83fa
Author(s)
Jin, Li
Amin, Saurabh
Date Issued
February 2018
Journal
IEEE Transactions on Automatic Control
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Jin, Li, and Saurabh Amin. “Stability of Fluid Queueing Systems with Parallel Servers and Stochastic Capacities.” IEEE Transactions on Automatic Control (2018): 1–1.
Version
Author's final manuscript
Abstract
IEEE This article introduces a Piecewise-Deterministic Queueing (PDQ) model to study the stability of traffic queues in parallel-link transportation systems facing stochastic capacity fluctuations. The saturation rate (capacity) of the PDQ model switches between a finite set of modes according to a Markov chain, and link inflows are controlled by a state-feedback policy. A PDQ system is stable only if a lower bound on the time-average link inflows does not exceed the corresponding time-average saturation rate. Furthermore, a PDQ system is stable if the following two conditions hold: the nominal mode's saturation rate is high enough that all queues vanish in this mode, and a Bilinear Matrix Inequality (BMI) involving an underestimate of the discharge rates of the PDQ in individual modes is feasible. The stability conditions can be strengthened for two-mode PDQs. These results can be used for design of routing policies that guarantee stability of traffic queues under stochastic capacity fluctuations.
MIT Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/TAC.2018.2808044
