| dc.contributor | 應數系 | - |
| dc.creator (作者) | Yen, Yuan Heng;Luh, Hsing Paul, Wang, Chia-Hung | - |
| dc.creator (作者) | 顏源亨 | - |
| dc.date (日期) | 2011-08 | - |
| dc.date.accessioned | 19-Aug-2015 16:56:18 (UTC+8) | - |
| dc.date.available | 19-Aug-2015 16:56:18 (UTC+8) | - |
| dc.date.issued (上傳時間) | 19-Aug-2015 16:56:18 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/77740 | - |
| dc.description.abstract (摘要) | Stationary probabilities are fundamental in response to various measures of performance in queueing networks. Solving stationary probabilities in Quasi-Birth-and-Death (QBD) with phase-type distribution normally are dependent on the structure of the queueing network. In this paper, a new computing scheme is developed for attaining stationary probabilities in queueing networks with multiple servers. This scheme provides a general approach of considering the complexity of computing algorithm. The result becomes more significant when a large matrix is involved in computation. The background theorem of this approach is proved and provided with an illustrative example in this paper. | - |
| dc.format.extent | 392592 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | Queueing Theory and Network Applications, 2011, 193-207 | - |
| dc.subject (關鍵詞) | markov processes; multiple servers; performance; phase-type distribution; queueing theory; stationary probability | - |
| dc.title (題名) | A matrix decomposition approach for solving state balance equations of a phase-type queueing model with multiple servers | - |
| dc.type (資料類型) | conference | en |
| dc.identifier.doi (DOI) | 10.1145/2021216.2021244 | - |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1145/2021216.2021244 | - |
