Duffy, K. and Pechersky, E.A. and Suhov, Y.M and Vvedenskaya, N.D.
Using estimated entropy in a queueing system with dynamic
Markov Process and Related Fields, 13 (1).
In this article we consider a discrete time two server queueing system with dynamic routing. We prove logarithmic asymptotics for the liklihood that a message from a source that divides its messages between the two servers in a way that minimizes the message's waiting time experiences a large waiting time. We demonstrate the merit of this asymptotic by comparing its predictions with experimental data. We illustrate how estimated entropies of the traffic streams can be used to predict the likelihood of long waiting times and demonstrate the method's accuracy through comparison with simulations.
||Queueing system; Dynamic routing; Large Deviation Principle (LDP); Estimated entropy; Hamilton Institute.
||Faculty of Science and Engineering > Computer Science
||07 Dec 2009 12:22
|Journal or Publication Title:
||Markov Process and Related Fields
Repository Staff Only(login required)
||Item control page