[go: up one dir, main page]

Skip to main content
Log in

On structural properties of the value function for an unbounded jump Markov process with an application to a processor sharing retrial queue

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

The derivation of structural properties for unbounded jump Markov processes cannot be done using standard mathematical tools, since the analysis is hindered due to the fact that the system is not uniformizable. We present a promising technique, a smoothed rate truncation method, to overcome the limitations of standard techniques and allow for the derivation of structural properties. We introduce this technique by application to a processor sharing queue with impatient customers that can retry if they renege. We are interested in structural properties of the value function of the system as a function of the arrival rate.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Blok, H., Spieksma, F.M.: Continuity and ergodicity properties of a parametrised collection of countable Markov processes. Technical report, Leiden University (2013)

  2. Down, D.G., Koole, G.M., Lewis, M.E.: Dynamic control of a single server system with abandonments. Queueing Syst. 69, 63–90 (2011)

    Article  Google Scholar 

  3. Guo, X., Hernández-Lerma, O.: Continuous-Time Markov Decision Processes. Springer, Berlin (2009)

    Book  Google Scholar 

  4. Hordijk, A., Spieksma, F.M.: On ergodicity and recurrence properties of a Markov chain with an application to an open Jackson network. Adv. Appl. Probab. 24, 343–376 (1992)

    Article  Google Scholar 

  5. Koole, G.M.: Monotonicity in Markov reward and decision chains: theory and applications. Found. Trends Stoch. Syst. 1, 1–76 (2006)

    Article  Google Scholar 

  6. Lippman, S.: Applying a new device in the optimization of exponential queuing systems. Oper. Res. 23, 687–709 (1975)

    Article  Google Scholar 

  7. Lund, R.B., Meyn, S.P., Tweedie, L.: Computable exponential convergence rates for stochastically ordered Markov processes. Anna. Appl. Probab. 6(1), 218–237 (1996)

    Article  Google Scholar 

  8. Sennott, L.I.: Stochastic Dynamic Programming and the Control of Queueing Systems. Wiley, New York (1999)

    Google Scholar 

  9. Serfozo, R.F.: An equivalence between continuous and discrete time Markov decision processes. Oper. Res. 27(3), 616–620 (1979)

    Article  Google Scholar 

  10. Spieksma, F.M.: Kolmogorov forward equation and explosiveness in countable state Markov processes. Ann. Oper. Res. (2013). doi:10.1007/s10479-012-1262-7

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. Bhulai.

Electronic supplementary material

Below is the link to the electronic supplementary material.

Supplementary material 1 (pdf 191 KB)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bhulai, S., Brooms, A.C. & Spieksma, F.M. On structural properties of the value function for an unbounded jump Markov process with an application to a processor sharing retrial queue. Queueing Syst 76, 425–446 (2014). https://doi.org/10.1007/s11134-013-9371-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-013-9371-9

Keywords

Mathematics Subject Classification (2000)