Importance sampling for weighted-serve-the-longest-queue

This paper considers buffer overflow probabilities for stable queueing systems with one server and different classes of arrivals. The service priority is given to the class of customers whose current weighted queue size is the largest (weighted-serve- the-longest-queue policy). We explicitly identify the exponential decay rate for the rare-event probabilities of interest and construct asymptotically optimal importance-sampling schemes for simulation.