Name
Title | ||
|---|---|---|
Stability and Control of Acyclic Stochastic Processing Networks With Shared Resources |
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/TAC.2011.2164012 | IEEE Trans. Automat. Contr. |
Keywords | Field | DocType |
Servers,Lyapunov methods,Stability analysis,Throughput,Routing,Stochastic processes,Computational modeling | Lyapunov function,Mathematical optimization,Control theory,Scheduling (computing),Server,Stochastic process,Matching (graph theory),Queueing theory,Throughput,Pattern matching,Mathematics,Distributed computing | Journal |
Volume | Issue | ISSN |
57 | 2 | 0018-9286 |
Citations | PageRank | References |
3 | 0.41 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ying-Chao Hung | 1 | 38 | 7.37 |
| George Michailidis | 2 | 303 | 35.19 |