| dc.contributor | 統計系 | en_US |
| dc.creator (作者) | 洪英超 | zh_TW |
| dc.creator (作者) | Hung, Ying-Chao ; Michailidis, George | - |
| dc.date (日期) | 2012.02 | en_US |
| dc.date.accessioned | 11-十一月-2013 17:46:16 (UTC+8) | - |
| dc.date.available | 11-十一月-2013 17:46:16 (UTC+8) | - |
| dc.date.issued (上傳時間) | 11-十一月-2013 17:46:16 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/61608 | - |
| dc.description.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. | en_US |
| dc.format.extent | 1853785 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | IEEE Transactions on Automatic Control, 57(2), 489-494 | en_US |
| dc.subject (關鍵詞) | Acyclic network;control;stability;maximal throughput;perturbed Lyapunov function method | en_US |
| dc.title (題名) | Stability and Control of Acyclic Stochastic Processing Networks with Shared Resources | en_US |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1109/TAC.2011.2164012 | en_US |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1109/TAC.2011.2164012 | en_US |
