Large deviations provide good approximation to queueing system with dynamic routing

Duffy, K. and Malone, D. and Pechersky, E. A. and Suhov, Y. M. and Vvedenskaya, N. D. (2004) Large deviations provide good approximation to queueing system with dynamic routing. (Preprint)

Share Twitter Facebook Email

[img] Text
DIAS-STP-04-15.pdf

Download (161kB)

Abstract

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.

Item Type: Article
Divisions: School of Theoretical Physics > Preprints
Date Deposited: 13 Jun 2018 14:41
Last Modified: 16 Jul 2018 13:00
URI: http://dair.dias.ie/id/eprint/464

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year