Stability of Fluid Queueing Systems with Parallel Servers and Stochastic Capacities

Li Jin, Saurabh Amin

Research output: Contribution to journalArticle

Abstract

This note 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 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.

Original languageEnglish (US)
Article number8295039
Pages (from-to)3948-3955
Number of pages8
JournalIEEE Transactions on Automatic Control
Volume63
Issue number11
DOIs
StatePublished - Nov 1 2018

Fingerprint

Servers
Fluids
State feedback
Markov processes
Switches

Keywords

  • Queueing systems
  • stability analysis
  • stochastic switching systems
  • traffic control

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Stability of Fluid Queueing Systems with Parallel Servers and Stochastic Capacities. / Jin, Li; Amin, Saurabh.

In: IEEE Transactions on Automatic Control, Vol. 63, No. 11, 8295039, 01.11.2018, p. 3948-3955.

Research output: Contribution to journalArticle

@article{d71fb904fe4141688465eb21a1ae2183,
title = "Stability of Fluid Queueing Systems with Parallel Servers and Stochastic Capacities",
abstract = "This note 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 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.",
keywords = "Queueing systems, stability analysis, stochastic switching systems, traffic control",
author = "Li Jin and Saurabh Amin",
year = "2018",
month = "11",
day = "1",
doi = "10.1109/TAC.2018.2808044",
language = "English (US)",
volume = "63",
pages = "3948--3955",
journal = "IEEE Transactions on Automatic Control",
issn = "0018-9286",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

TY - JOUR

T1 - Stability of Fluid Queueing Systems with Parallel Servers and Stochastic Capacities

AU - Jin, Li

AU - Amin, Saurabh

PY - 2018/11/1

Y1 - 2018/11/1

N2 - This note 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 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.

AB - This note 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 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.

KW - Queueing systems

KW - stability analysis

KW - stochastic switching systems

KW - traffic control

UR - http://www.scopus.com/inward/record.url?scp=85042178057&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85042178057&partnerID=8YFLogxK

U2 - 10.1109/TAC.2018.2808044

DO - 10.1109/TAC.2018.2808044

M3 - Article

VL - 63

SP - 3948

EP - 3955

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

SN - 0018-9286

IS - 11

M1 - 8295039

ER -