Optimal Server Assignment in Multi-Server Parallel Queueing Systems With Random Connectivities and Random Service Failures
Source: Carleton University
The problem of assignment of K identical servers to a set of N symmetric parallel queues is investigated in this paper. The parallel queueing system is considered to be time slotted and the connectivity of each queue to each server is varying randomly over time and following Bernoulli distribution with a given parameter. Each server is capable of serving at most one packet per time slot (if it is connected and assigned to a queue). At any time slot, each server can serve at most one queue and each queue can be served by at most one server. The authors assume that the service of a scheduled packet by a connected server fails randomly with a certain probability.