Duffy, Ken R., Malone, David, Pechersky, E.A., Suhov, Y.M and Vvedenskaya, N.D. (2004) Large deviations provide good approximation to queueing system with dynamic routing. Technical Paper DIAS-STP-04-15. Technical Report. Dublin Institute for Advanced Studies.
Preview
DM-Large-Deviations.pdf
Download (161kB) | Preview
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: | Monograph (Technical Report) |
---|---|
Additional Information: | The work was partly done at the Dublin Institute for Advanced Studies, Ireland. The authors thank Tony Dorlas for his hospitality. The work of E.A.P. and N.D.V. was partly supported by Russian RFFI grant 02-01-00068. K.D and D.M are supported by Science Foundation Ireland under the national development plan. |
Keywords: | Large deviations; queueing system; dynamic routing; |
Academic Unit: | Faculty of Science and Engineering > Research Institutes > Hamilton Institute Faculty of Science and Engineering > Mathematics and Statistics |
Item ID: | 6192 |
Depositing User: | Dr. David Malone |
Date Deposited: | 11 Jun 2015 15:42 |
Publisher: | Dublin Institute for Advanced Studies |
Funders: | Science Foundation Ireland (SFI) |
URI: | https://mu.eprints-hosting.org/id/eprint/6192 |
Use Licence: | This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here |
Repository Staff Only (login required)
Downloads
Downloads per month over past year