Hung Y.-CMichailidis G.YING-CHAO HUNG2022-11-112022-11-11201200189286https://www.scopus.com/inward/record.uri?eid=2-s2.0-84856424316&doi=10.1109%2fTAC.2011.2164012&partnerID=40&md5=5f5c390c2478b7e342ffd56ae11f78cdhttps://scholars.lib.ntu.edu.tw/handle/123456789/625031We 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.Acyclic network; control; maximal throughput; perturbed Lyapunov function method; stabilityAcyclic 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 stabilityjournal article10.1109/TAC.2011.21640122-s2.0-84856424316