Asymptotic behavior of a critical fluid model for a multiclass processor sharing queue via relative entropy
- 37 Downloads
This work concerns the asymptotic behavior of critical fluid model solutions for a multiclass processor sharing queue under general distributional assumptions. Such critical fluid model solutions are measure-valued functions of time. We prove that critical fluid model solutions converge to the set of invariant states as time goes to infinity, uniformly for all initial conditions lying in certain relatively compact sets. This generalizes an earlier single-class result of Puha and Williams to the more complex multiclass setting. In particular, several new challenges are overcome, including formulation of a suitable relative entropy functional and identifying a convenient form of the time derivative of the relative entropy applied to trajectories of critical fluid model solutions.
KeywordsQueueing Multiclass processor sharing Critical fluid model Fluid model asymptotics Relative entropy
Mathematics Subject ClassificationPrimary 60K25 60F17 Secondary 60G57 68M20 90B22
- 6.Mulvany, J.A.: A relative entropy approach to study critical fluid model solutions for multiclass processor sharing queues. Master’s Thesis. California State University San Marcos (2018)Google Scholar
- 7.Paganini, F., Tang, A., Ferragut, A., Andrew, L.L.H.: Stability of networks under general file size distribution with alpha fair rate allocation. In: Proceedings of Allerton Conference, UIUC, IL (2009)Google Scholar