We consider a system with two infinite-buffer FCFS servers (of speed one). The arrivals processes are three independent Poisson flows Ξ_i , of rates λ_i, i = 0, 1, 2, each with IID task service times. The tasks from Ξ_i are directed to server i, i = 1, 2 (dedicated traffic). The tasks from Ξ_0 are directed to the server that has the shorter workload in the buffer at the time of arrival (opportunistic traffic). We compare the analytical data for the large deviation (LD) probabilities for the virtual waiting time in flow Ξ_0 and empercial delay freqencies from simulations
