A finite-buffer queue with a single vacation policy: An analytical study with evolutionary positioning-Reference-Cited by-同舟云学术

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

Published:2014-12-01 Issue:4 Volume:24 Page:887-900
ISSN:2083-8492
Container-title:International Journal of Applied Mathematics and Computer Science
language:en
Short-container-title:

Author:

Woźniak Marcin¹,Kempa Wojciech M.¹,Gabryel Marcin²,Nowicki Robert K.³

Affiliation:

1. Institute of Mathematics Silesian University of Technology, ul. Kaszubska 23, 44-100 Gliwice, Poland

2. Institute of Computational Intelligence Cestochowa University of Technology, Al. Armii Krajowej 36, 42-200 Częstochowa, Poland

3. Institute of Computational Intelligence Częstochowa University of Technology, Al. Armii Krajowej 36, 42-200 Cz˛estochowa, Poland

Abstract

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.

Publisher

Walter de Gruyter GmbH

Subject

Applied Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Link

https://www.sciendo.com/pdf/10.2478/amcs-2014-0065

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Analysis of a Markovian retrial queueing system with impatience and vacation model;2ND INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2021;2022

2. From Exhaustive Vacation Queues to Preemptive Priority Queues with General Interarrival Times;International Journal of Applied Mathematics and Computer Science;2018-12-01

3. On Loss Process in a Queueing System Operating Under Single Vacation Policy;Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology – ISAT 2017;2017-09-07

4. Parallelization of Fast Sort Algorithm;Communications in Computer and Information Science;2017

5. Buffer Overflow Duration in a Model of WSN Node with Power Saving Mechanism Based on SV Policy;Communications in Computer and Information Science;2017