Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/68194| DC Field | Value | Language |
|---|---|---|
| dc.contributor | 應數系 | en_US |
| dc.creator | 陸行 | zh_TW |
| dc.creator | Luh,Hsing | en_US |
| dc.date | 2004 | en_US |
| dc.date.accessioned | 2014-08-05T09:33:44Z | - |
| dc.date.available | 2014-08-05T09:33:44Z | - |
| dc.date.issued | 2014-08-05T09:33:44Z | - |
| dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/68194 | - |
| dc.description.abstract | We consider a queueing model with finite capacities. External arrivals follow a Coxian distribution. Due to the limitation of the capacity, arrivals may be lost if the buffer is full. Our goal is to study the probability of blocking. In order to obtain the steady-state probability distribution of this model, we construct an embedded Markov chain at the departure points. The solution is solved analytically and its analysis is extended to semi-Markovian representation of performance measures in queueing networks. | en_US |
| dc.format.extent | 202503 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en_US | - |
| dc.relation | International Journal of Operations Research,1(1), 71-76 | en_US |
| dc.source.uri | http://www.orstw.org.tw/ijor/6_volume1_no1.html | en_US |
| dc.subject | Queueing Networks;Probability Distribution;Embedded Markov Chain | en_US |
| dc.title | A Queueing Model of General Servers in Tandem with Finite Buffer Capacities | en_US |
| dc.type | article | en |
| item.fulltext | With Fulltext | - |
| item.languageiso639-1 | en_US | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
| item.cerifentitytype | Publications | - |
| item.grantfulltext | restricted | - |
| item.openairetype | article | - |
| Appears in Collections: | 期刊論文 | |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.