A MAP-modulated fluid flow model with multiple vacations
We consider a MAP-modulated fluid flow queueing model with multiple vacations. As soon as the fluid level reaches zero, the server leaves for repeated vacations of random length V until the server finds any fluid in the system. During the vacation period, fluid arrives from outside according to the...
Saved in:
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2013
|
| Online Access: | https://hdl.handle.net/10356/79645 http://hdl.handle.net/10220/10379 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | We consider a MAP-modulated fluid flow queueing model with multiple vacations. As soon as the fluid level reaches zero, the server leaves for repeated vacations of random length V until the server finds any fluid in the system. During the vacation period, fluid arrives from outside according to the MAP (Markovian Arrival Process) and the fluid level increases vertically at the arrival instance. We first derive the vector Laplace–Stieltjes transform (LST) of the fluid level at an arbitrary point of time in steady-state and show that the vector LST is decomposed into two parts, one of which the vector LST of the fluid level at an arbitrary point of time during the idle period. Then we present a recursive moments formula and numerical examples. |
|---|