Skip to main content
Search
Search
Quick Search anywhere
Quick Search anywhere
Quick Search anywhere
Quick Search anywhere
Quick Search anywhere
Quick Search anywhere
Advanced Search
Skip main navigation
No Access

Strong and weak stochastic bounds for multidimensional Markov chains

Published Online:March 3, 2014pp 148-168https://doi.org/10.1504/IJCCBS.2014.059592

Abstract

We study queueing networks similar to Jackson networks, modelled by a multidimensional Markov chain. The performance analysis may be very difficult or intractable, if there is no specific solution form. We explain how stochastic comparisons of Markov chains can be used to overcome this problem. We build new queueing which are easier to analyse and providing stochastic bounds (upper or lower) for the original model. In this paper, we propose different queueing systems in the sense of the strong and weak stochastic ordering for a general queueing network model in order to compute performance measure bounds as blocking probabilities. We discuss the accuracy of the bounds under different input parameter values.

Keywords

queueing networks, stochastic comparisons, weak and strong orderings, blocking probabilities

References

  • 1. Castel-Taleb, H. , Mokdad, L. (2005). ‘Performance measure bounds in wireless networks by state space reduction’. IEEE Inter. Sym. on Modeling Analysis and Simulation of Computer and Telecommunication Syst. (MASCOTS). Atlanta, USA Google Scholar
  • 2. Castel-Taleb, H. , Pekergin, N. (2009). ‘Weak stochastic comparisons for performability verification’. IEEE Inter. Conf. on Analytical and Stochastic Modeling Tech. App (ASMTA), Nicosia, Cyprus, 294-308, LNCS 5513 Google Scholar
  • 3. Castel-Taleb, H. , Pekergin, N. (2011). ‘Strong and weak orderings for an accurate resource dimensioning’. in Proc. of the 5th Int. Conf. Verification and Evaluation of Computer and Communication System (VECOS ‘11). Tunisia, British Computer Society, 22-33 Google Scholar
  • 4. Castel-Taleb, H. , Mokdad, L. , Pekergin, N. (2007). ‘Aggregated bounding Markov processes applied to the analysis of tandem queues’. ACM Sig. Inter. Conf. on Performance Evaluation Methodologies and Tools (ValueTools), Nantes, France Google Scholar
  • 5. Doisy, M. (1992). Comparaison de Processus Markoviens. Univ. de Pau et des pays de l’Adour, phD thesis Google Scholar
  • 6. Economous, A. (2003). ‘Necessary and sufficient condition for the stochastic comparison of Jackson networks’. prob. in the Engineering and Informational Sciences. 17, 143-151 Google Scholar
  • 7. Fourneau, J.M. , Pekergin, N. (2002). ‘An algorithmic approach to stochastic bounds’. in Performance Evaluation of Complex Systems: Techniques and Tools. LNCS 2459 Google Scholar
  • 8. Lindvall, T. (1992). Lectures on the Coupling Method. New York, Wiley Series in Probability and Mathematical Statistics Google Scholar
  • 9. Lopez, F.J. , Martinez, S. , Sanz, G. (2000). ‘Stochastic domination and Markovian couplings’. Adv. Appl. Prob.. 32, 1064-1076 Google Scholar
  • 10. Massey, W. (1984). ‘An operator-analytic approach to the Jackson network’. J. Appl. Prob.. 21, 379-393 Google Scholar
  • 11. Massey, W. (1986). ‘A family of bounds for the transient behavior of a Jackson network’. J. Appl. Prob.. 23, 2, 543-549 Google Scholar
  • 12. Massey, W. (1987). ‘Stochastic orderings for Markov processes on partially ordered spaces’. Math. of Operations Research. 12, 2, 350-367 Google Scholar
  • 13. Ridder, A. (1995). ‘Weak stochastic ordering for multidimensional Markov chains’. Oper. Research Letters. 18, 121-126 Google Scholar
  • 14. Stoyan, D. (1976). Comparison Methods for Queues and Other Stochastic Models. Chichester:John Wiley & Sons Google Scholar
  • 15. Trivedi, K. (2002). Probability, Statistics and Reliability Queueing and Computer Science Applications. New York:Wiley Interscience Publication Google Scholar
Previous article