Skip to main content
Log in

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

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ben Tahar, A., Jean-Marie, A.: The fluid limit of the multiclass processor sharing queue. Queueing Syst. Theory Appl. 71, 347–404 (2012)

    Article  Google Scholar 

  2. Bramson, M.: Convergence to equilibria for fluid models of FIFO queueing networks. Queueing Syst. Theory Appl. 22, 5–45 (1996)

    Article  Google Scholar 

  3. Bramson, M.: Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networks. Queueing Syst. Theory Appl. 22, 5–45 (1996)

    Article  Google Scholar 

  4. Gromoll, H.C., Puha, A.L., Williams, R.J.: The fluid limit of a heavily loaded processor sharing queue. Ann. Appl. Probab. 12, 797–859 (2002)

    Article  Google Scholar 

  5. Gromoll, H.C., Williams, R.J.: Fluid limits for networks with bandwidth sharing and general document size distributions. Ann. Appl. Probab. 19, 243–280 (2009)

    Article  Google Scholar 

  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)

  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)

  8. Paganini, F., Tang, A., Ferragut, A., Andrew, L.L.H.: Network stability under alpha fair bandwidth allocation with general file size distribution. IEEE Trans. Autom. Control 57, 579–591 (2012)

    Article  Google Scholar 

  9. Puha, A.L., Stoylar, A.L., Williams, R.J.: The fluid limit of an overloaded processor sharing queue. Math. Oper. Res. 31, 316–350 (2006)

    Article  Google Scholar 

  10. Puha, A.L., Williams, R.J.: Invariant states and rates of convergence for a critical fluid model of a processor sharing queue. Ann. Appl. Probab. 14, 517–554 (2004)

    Article  Google Scholar 

  11. Puha, A.L., Williams, R.J.: Asymptotic behavior of a critical fluid model for a processor sharing queue via relative entropy. Stoch. Syst. 6, 251–300 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Amber L. Puha.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Research supported in part by NSF Grants DMS-1510198 (Mulvany and Puha) and DMS-1712974 (Williams).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mulvany, J.A., Puha, A.L. & Williams, R.J. Asymptotic behavior of a critical fluid model for a multiclass processor sharing queue via relative entropy. Queueing Syst 93, 351–397 (2019). https://doi.org/10.1007/s11134-019-09629-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-019-09629-8

Keywords

Mathematics Subject Classification

Navigation