Stability and control of acyclic stochastic processing networks with shared resources
Journal
IEEE Transactions on Automatic Control
Journal Volume
57
Journal Issue
2
Pages
489-494
Date Issued
2012
Author(s)
Abstract
We consider a general model framework for acyclic stochastic processing networks with shared resources that has many applications in telecommunication, computer, and manufacturing systems. A dynamic control policy that utilizes the maximal matching (for scheduling) and the join-the-shortest-queue (for routing) discipline, is shown to maximize the throughput and stabilize the system in a sense called uniform mean recurrence time property under fairly mild stochastic assumptions. Owing to the non-Markovian nature of the states, system stability is established using a perturbed Lyapunov function method. © 2011 IEEE.
Subjects
Acyclic network; control; maximal throughput; perturbed Lyapunov function method; stability
Other Subjects
Acyclic networks; Dynamic control policy; General model; Join-the-shortest-queue; Lyapunov function method; Maximal matchings; Maximal throughput; Non-Markovian; perturbed Lyapunov function method; Recurrence time; Shared resources; Stability and control; Stochastic processing networks; Computer control systems; Control; Convergence of numerical methods; Lyapunov functions; Packet networks; Random processes; Stochastic models; Stochastic systems; Control system stability
Type
journal article