Have a personal or library account? Click to login
A finite-buffer queue with a single vacation policy: An analytical study with evolutionary positioning Cover

A finite-buffer queue with a single vacation policy: An analytical study with evolutionary positioning

Open Access
|Dec 2014

Abstract

In this paper, application of an evolutionary strategy to positioning a GI/M/1/N-type finite-buffer queueing system with exhaustive service and a single vacation policy is presented. The examined object is modeled by a conditional joint transform of the first busy period, the first idle time and the number of packets completely served during the first busy period. A mathematical model is defined recursively by means of input distributions. In the paper, an analytical study and numerical experiments are presented. A cost optimization problem is solved using an evolutionary strategy for a class of queueing systems described by exponential and Erlang distributions.

DOI: https://doi.org/10.2478/amcs-2014-0065 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Language: English
Page range: 887 - 900
Submitted on: Oct 16, 2013
Published on: Dec 20, 2014
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2014 Marcin Woźniak, Wojciech M. Kempa, Marcin Gabryel, Robert K. Nowicki, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.