Analysis of queue-length dependent vacations and P-limited service in \(\mathrm{BMAP}/\mathrm{G}/1/N\) systems: stationary distributions and optimal control (Q2444206)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Analysis of queue-length dependent vacations and P-limited service in BMAP/G/1/N systems: stationary distributions and optimal control |
scientific article; zbMATH DE number 6281759
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of queue-length dependent vacations and P-limited service in \(\mathrm{BMAP}/\mathrm{G}/1/N\) systems: stationary distributions and optimal control |
scientific article; zbMATH DE number 6281759 |
Statements
Analysis of queue-length dependent vacations and P-limited service in \(\mathrm{BMAP}/\mathrm{G}/1/N\) systems: stationary distributions and optimal control (English)
0 references
9 April 2014
0 references
Summary: We consider a finite-buffer single server queueing system with queue-length dependent vacations where arrivals occur according to a batch Markovian arrival process (BMAP). The service discipline is P-limited service, also called E-limited with limit variation (ELV) where the server serves until either the system is emptied or a randomly chosen limit of \(L\) customers has been served. Depending on the number of customers present in the system, the server will monitor his vacation times. Queue-length distributions at various epochs such as before, arrival, arbitrary and after, departure have been obtained. Several other service disciplines like Bernoulli scheduling, nonexhaustive service, and E-limited service can be treated as special cases of the P-limited service. Finally, the total expected cost function per unit time is considered to determine locally optimal values \(N^\ast\) of \(N\) or a maximum limit \(\hat{L}^\ast\) of \(\hat{L}\) as the number of customers served during a service period at a minimum cost.
0 references
finite-buffer single server queueing system
0 references
queue-length dependent vacations
0 references
batch Markovian arrival process (BMAP)
0 references
queue-length distribution
0 references
0 references
0 references
0 references
0.8692135810852051
0 references
0.8638784885406494
0 references
0.860284149646759
0 references
0.8427215814590454
0 references
0.8318735957145691
0 references