Genetic Cost Optimization of the GI/M/1/N Finite-Buffer Queue with a Single Vacation Policy

Marcin Gabryel, Robert K. Nowicki, Marcin Wozniak, Wojciech M. Kempa

Abstract: In the artice, problem of the cost optimization of the GI/M/1/N-type queue with finite buffer and a single vacation policy is analyzed. Basing on the explicit representation for the joint transform of the first busy period, first idle time and the number of packets transmitted during the first busy period and fixed values of unit costs of the server’s functioning an optimal set of system parameters is found for exponentially distributed vacation period and 2-Erlang distribution of inter arrival times. The problem of optimization is solved using genetic algorithm. Different variants of the load of the system are considered as well.