Details

Analysis of QNMS with Blocking after Service and Maximize the Uncertainty of Outcomes

K M Sharma

B.S.A. College, Mathura (U.P.) India

Shiv Kumar Sharma

B.S.A. College, Mathura (U.P.) India

52-57

Vol: 6, Issue: 3, 2016

Receiving Date: 2016-05-04 Acceptance Date:

2016-07-06

Publication Date:

2016-07-17

Download PDF

Abstract

An important issue for the performance modelling and evaluation of modern high-speed communications networks is traffic congestion due to the limited capacity of the network resources. Such problems give rise to the phenomenon of blocking. In this paper a new algorithm is proposed, based on the principle of maximum entropy(ME), for the approximate analysis of arbitrary open queuing network models(QNMs) with finite capacity, external Poisson arrivals and single exponential severs under blocking after service(BAS). Remarks on the validation of the ME algorithm and future work are included

Keywords: Queuing networks models(QNM); Maximum Entropy(ME); Principles; Blocking after Service (BAS).

References

  1. Kouvatsos, D.D. (1985): Maximum entropy methods for general queuing networks, inModelling Techniques and Tools for Performance Analysis, ed. D. Potier, North-Holland, pp. 589-609
  2. Kouvatsos, D.D. (1986): Maximum entropy and the G/G/1/N queue, Acta Informatica,vol. 23, pp. 545-565.
  3. Kouvatsos, D.D. and Denazis, S.G. (1993): Entropy maximised queuing networks with blocking and multiple job classes, Performance Evaluation, vol. 17,pp. 189-205
  4. Perros, H.G. (1994): Queuing Networks with Blocking, Oxford University Press.
  5. Kouvatsos, D.D. and I.U. Awan, (1998): MEM for arbitrary closed queuing networks with RS-blocking and multiple job classes, Annals of Oper. Res., 79, pp.231-269
  6. Kouvatsos, D.D. and I.U. Awan, R.J.Fretwell and R.Dimakopoulos, (2000): G.A cost –effective approximation for SRD traffic in arbitrary multi-buffered networks, Computers Networks, 34, pp.97-113
  7. Y.Li, Kouvatsos D.D and W.Xi (2009): Performance modelling and analysis of 4G handoff priority scheme for cellular networks in “Performance modelling and analysis of Heterogeneous Networks” River Publishers, pp., 215-243
  8. Alanazi J.S. and Kouvatsos D.D, (2011): A unified ME algorithm for arbitrary open QNMs with mixed blocking mechanisms,in “Proc. Of the IEEE/IPSJ Workshop WS-8: Future Internet Engineering of the SAINT 2011 International symposium on Applications and Internet”Munich, pp.292-296.
  9. Alanazi J.S. and Kouvatsos D.D, (2011): On the experimentation with the unified ME algorithm for arbitrary open QNMs-B, Technical Report TR7- NetPEn-April 11, University of Bradford
  10. Balsamo.S. (2011): Queuing networks with blocking analysis,solution algorithms and properties in “Network performance Engineering, A Handbook on Convergent Multi-Service Networks and Next Generation Internet, Lecture Notes in computer Science” (ed. Kouvatsos, D.D.5233),pp., 233-257
  11. Balsamo.S. Nitto Persone V.D. and Onvural R. (2001): “Analysis of Queuing Networks with Blocking “Kluwer Academic publishers, Dordrecht
  12. Assi S.A. and Kouvatsos D.D (2011): On the analysis of queues with heavy tails, a non –extensive maximum entropy formalism and a generalisation of the Zipf –mandelbrot distribution in “special IFIP LNCS issue in Honour of Guenter Haring ” University of Vienna to appear.
  13. Assi S.A. and Kouvatsos D.D (2011):Generalised entropy maximisation and queues with bursty and / or heavy tails, in “ Network Performance Engineering, A Handbook on Convergent Multi-Service Networks and Next Generation Internet , Lecture Notes in Computer Science ” 5233, pp. 357-392
Back

Disclaimer: All papers published in IJRST will be indexed on Google Search Engine as per their policy.

We are one of the best in the field of watches and we take care of the needs of our customers and produce replica watches of very good quality as per their demands.