A queueing-theoretic analysis of the threshold-based exhaustive data-backup scheduling policy
| Authors |
|
|---|---|
| Publication date | 2017 |
| Host editors |
|
| Book title | International Conference on Numerical Analysis and Applied Mathematics (ICNAAM 2016) : Rhodes, Greece, 19-25 September 2016 |
| ISBN (electronic) |
|
| Series | AIP Conference Proceedings |
| Article number | 200002 |
| Number of pages | 3 |
| Publisher | Melville, NY: AIP Publishing |
| Organisations |
|
| Abstract | We analyse the threshold-based exhaustive data backup scheduling mechanism by means of a queueing-theoretic approach. Data packets that have not yet been backed up are modelled by customers waiting for service (back-up). We obtain the probability generating function of the system content (backlog size) at random slot boundaries in steady state. |
| Document type | Conference contribution |
| Language | English |
| Published at | https://doi.org/10.1063/1.4992373 |
| Downloads |
A queueing-theoretic analysis of the threshold-based exhaustive data-backup scheduling policy
(Final published version)
|
| Permalink to this page | |