Stabilizing Queuing Networks With Model Data-Independent Control

Classical queuing network control strategies typically rely on accurate knowledge of model data, i.e., arrival and service rates. However, such data are not always available and may be time-variant. To address this challenge, we consider a class of model data-independent (MDI) control policies that only rely on traffic state observation and network topology. In this article, we focus on the MDI control policies that can stabilize multiclass Markovian queuing networks under centralized and decentralized policies. Control actions include routing, sequencing, and holding. By expanding the routes and constructing piecewise-linear test functions, we derive an easy-to-use criterion to check the stability of a multiclass network under a given MDI policy. For stabilizable multiclass networks, we show that a centralized, stabilizing MDI policy exists. For stabilizable single-class networks, we further show that a decentralized, stabilizing MDI policy exists. In addition, for both settings, we construct explicit policies that attain maximal throughput and present numerical examples to illustrate the results.