On Applying Cuckoo Search Algorithm to Positioning GI/M/1/N Finite-Buffer Queue with a Single Vacation Policy

In the article is presented possible application of swarm intelligence in the positioning of computer or queuing systems. As an object recognition for swarm intelligence is given a problem of cost optimization of the GI/M/1/N-type queue with finite buffer and a single vacation policy. Positioning of the analyzed queuing system was done using swarm intelligence, in particular cuckoo search algorithm (CS), 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 during the service. An optimal set of system parameters is found by CS for exponentially distributed vacation period and 2-Erlang distribution of inter arrival times.