| Project/Area Number |
16H06914
|
|---|
| Research Category |
Grant-in-Aid for Research Activity Start-up
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Mathematical informatics
|
|---|
| Research Institution | Osaka University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2016-08-26 – 2018-03-31
|
| Project Status |
Completed (Fiscal Year 2017)
|
| Budget Amount *help |
¥2,990,000 (Direct Cost: ¥2,300,000、Indirect Cost: ¥690,000)
Fiscal Year 2017: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2016: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
|
|---|
| Keywords | 待ち行列理論 / M/G/1+G / 行列解析法 / マルコフ過程 / マルコフ連鎖 / 数値計算アルゴリズム |
|---|
| Outline of Final Research Achievements |
We studied queueing models which can represent situations that the offered load exceeds the service capacity of the system. We mainly dealt with the queueing models with impatient customers, where new arrivals to the system are (fully or partially) rejected when the system is congested. For the M/G/1+PH queue, we established algorithmic analytic methods for the stationary loss probability and the stationary queue-length distribution. We further considered batch-arrival queueing models with impatient customers (M[x]/G/1+G queues). We analyzed two types of M[x]/G/1+G queues: In the first variant, customers in the same batch have the same patience time, while in the second variant, patience times of all customers are independent. In addition, we derived a general relation for the stationary distribution of continuous-time stochastic processes whose sample-paths are piece-wise linear.
|
