Home | Articles | Past volumes | About | Login | Notify | Contact | Search
 Stochastic Systems > Vol. 6 (2016) open journal systems 


Asymptotic behavior of a critical fluid model for a processor sharing queue via relative entropy

Amber L. Puha, California State University San Marcos
Ruth J. Williams, University Of California, San Diego


Abstract
In this paper, we develop a new approach to studying the asymptotic behavior of fluid model solutions for critically loaded processor sharing queues. For this, we introduce a notion of relative entropy associated with measure-valued fluid model solutions. In contrast to the approach used in [12], which does not readily generalize to networks of processor sharing queues, we expect the approach developed in this paper to be more robust. Indeed, we anticipate that similar notions involving relative entropy may be helpful for understanding the asymptotic behavior of critical fluid model solutions for stochastic networks operating under various resource sharing protocols naturally described by measure-valued processes.

AMS 2000 subject classifications: Primary 60K25, 60F17; secondary 60G57, 68M20, 90B22.

Keywords: Queueing, processor sharing, critical fluid model, fluid model asymptotics, relative entropy.

Creative Common LOGO

Full Text: PDF


Puha, Amber L., Williams, Ruth J., Asymptotic behavior of a critical fluid model for a processor sharing queue via relative entropy, Stochastic Systems, 6, (2016), 251-300 (electronic). DOI: 10.1214/15-SSY198.

References

[1]    Bramson, M. (1998). State space collapse with applications to heavy traffic limits for multiclass queueing networks. Queueing Systems: Theory and Applications 30 89–148. MR1663763

[2]    Ethier, S. N. and Kurtz, T. G. (1986). Markov Processes: Characterization and Convergence. John Wiley & Sons, Inc., New York. MR0838085

[3]    Georgii, H. (1988). Gibbs Measures and Phase Transitions. Walter de Gruyter. MR0956646

[4]    Gibbs, A. L. and Su, F. E. (2002). On Choosing and Bounding Probability Metrics. International Statistical Review 70 419–435.

[5]    Gromoll, H. C. (2004). Diffusion approximation for a processor sharing queue in heavy traffic. Annals of Applied Probability, 14 555–611. MR2052895

[6]    Gromoll, H. C. and Puha, A. L. and Williams, R. J. (2002). The fluid limit of a heavily loaded processor sharing queue. Annals of Applied Probability 12 (2002) 797–859. MR1925442

[7]    Huber, P. (1981). Robust Statistics. John Wiley & Sons Inc. MR0606374

[8]    Kallenberg, O. (1986). Random Measures. Academic Press. MR0854102

[9]    Kullback, S. (1967). A lower bound for discrimination in terms of variation. IEEE Trans. Inform. Thoery 13 126–127.

[10]    Paganini, F. and Tang, A. and Ferragut, A. and Andrew, L. L. H.. (2009). Stability of networks under general file size distribution with alpha fair rate allocation. Proceedings Allerton Conference, UIUC, IL.

[11]    Paganini, F. and Tang, A. and Ferragut, A. and Andrew, L. L. H.. (2012). Network stability under alpha fair bandwidth allocation with general file size distribution. IEEE Transactions on Automatic Control, 57, 579–591. MR2919939

[12]    Puha, A. L. and Williams, R. J. (2004) Invariant states and rates of convergence for a critical fluid model of a processor sharing queue. Annals of Applied Probability 14 517–554. MR2052894

[13]    Prohorov, Yu. V. (1956). Convergence of random processes and limit theorems in probability theory. Theory of Probability and its Applications 1 157–214. MR0084896

[14]    Rao, M. and Chen, Y. and Vermuri, B. C. and Wang, F. (2004) Cumulative residual entropy, a new measure of information IEEE Transactions on Information Theory 50, 1220–1228. MR2094878

[15]    Williams, R. J. (1998). Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse. Queueing Systems: Theory and Applications 30 27–88. MR1663759




Home | Articles | Past volumes | About | Login | Notify | Contact | Search

Stochastic Systems. ISSN: 1946-5238