Studies on queues interacting with their underlying processes
| Project/Area Number |
25330027
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Mathematical informatics
|
|---|
| Research Institution | Osaka University |
|---|
Principal Investigator |
Takine Tetsuya 大阪大学, 工学(系)研究科(研究院), 教授 (00216821)
|
|---|
| Project Period (FY) |
2013-04-01 – 2016-03-31
|
| Project Status |
Completed (Fiscal Year 2015)
|
| Budget Amount *help |
¥4,940,000 (Direct Cost: ¥3,800,000、Indirect Cost: ¥1,140,000)
Fiscal Year 2015: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2014: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2013: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
|---|
| Keywords | 待ち行列 / 背後過程 / 相互作用 / working vacation / 途中退去 / 待ち時間制約 / 呼損率 / M/G/1+G / MAP/M/c+D / M/PH/c+D / M/G/1 / 確率順序 / マルコフ型到着過程 |
|---|
| Outline of Final Research Achievements |
We studied queues interacting with the underlying processes. In particular, we consider queues with working vacations and queues with impatient customers. In queues with working vacations, the underlying process is reset when the system becomes empty, and queues with impatient customers are equivalent to queues with workload-dependent arrivals. As for the former, we established a matrix-analytic method for the workload process corresponding to the case that the underlying Markov chain is reset when the system becomes empty. As for the latter, we accomplished the analysis of MAP/M/c+D and M/PH/c+D queues and revealed various properties of the loss probability in the M/G/1+G queue.
|
Report
(4 results)
Research Products
(7 results)
