Entropy maximisation and open queueing networks with priorities and blocking

Performance Evaluation

Volumn 51, Issue 2-4, 2003, Pages 191-227

  Kouvatsos, Demetres ^a   Awan, Irfan ^a  

^a UNIVERSITY OF BRADFORD   (United Kingdom)

Author keywords

Complete buffer sharing (CBS) scheme; Compound Poisson process (CPP); Head of line (HOL) rule; Maximum entropy (ME) principle; Partial buffer sharing (PBS) scheme; Preemptive resume (PR) rule; Queueing network models (QNMs)

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONSTRAINT THEORY; ENTROPY; OPTIMIZATION; QUEUEING THEORY; TOPOLOGY;

MAXIMUM ENTROPY (ME) PRINCIPLE;

QUEUEING NETWORKS;

EID: 0037296749     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(02)00092-5     Document Type: Conference Paper

References (39)

1. Baskett F., Chandy K.M., Muntz R.R., Palacios F.G., Open, closed and mixed networks of queues with different classes of customers. J. ACM. 22(2):1975;248-260.
2. F.P. Kelly, Reversibility and Stochastic Networks, Wiley, New York, 1975.
3. I.F. Akyildiz, C.C. Huang, Exact analysis of multi-job class networks of queues with blocking-after service, in: R.O. Onvural, I.F. Akyildiz (Eds.), Proceedings of the Second International Workshop on Queueing Networks with Finite Capacity, Research Triangle Park, 1992, pp. 258-271.
4. Altiok T., Perros H.G., Approximate analysis of arbitrary configurations of queueing networks with blocking. Ann. Oper. Res. 9:1987;481-509.
5. Labetoulle J., Pujolle G., Isolation method in a network of queues. IEEE Trans. Software Eng. SE-6:1980;373-381.
6. Takahashi Y., Miyahara H., Hasegawa T., An approximation method for open restricted queueing networks. Oper. Res. 28:1980;594-602.
7. Yao D., Buzacott J.A., Modelling a class of state dependent routing in flexible manufacturing systems. Ann. Oper. Res. 3:1985;153-167.
8. Kouvatsos D.D., Xenios N.P., MEM for arbitrary queueing networks with multiple general servers and repetitive-service blocking. Perform. Evaluation. 10:1989;169-195.
9. Kouvatsos D.D., Denazis S.G., Entropy maximised queueing networks with blocking and multiple job classes. Perform. Evaluation. 17:1993;189-205.
10. Kouvatsos D.D., Entropy maximisation and queueing network models. Ann. Oper. Res. 48:1994;63-126.
11. Kouvatsos D.D., Awan I.U., MEM for arbitrary closed queueing networks with RS-blocking and multiple job classes. Ann. Oper. Res. 79:1998;231-269.
12. Kouvatsos D.D., Tabet-Aouel N.M., A maximum entropy priority approximation for a stable G/G/1 queue. Acta Inf. 27:1989;247-286.
13. D.D. Kouvatsos, N.M. Tabet-Aouel, Product-form approximations for an extended class of general closed queueing networks, in: P.J.B. King, et al. (Eds.), Performance'90, North-Holland, Amsterdam, 1990, pp. 301-315.
14. I.U. Awan, D.D. Kouvatos, Approximate analysis of arbitrary QNMs with space and service priorities, in: D.D. Kouvatsos (Ed.), Performance Analysis of ATM Networks, Kluwer Academic Publishers, Dordrecht, 1999, pp. 497-521.
15. I.U. Awan, D.D. Kouvatos, Maximum entropy analysis of arbitrary queueing network models with service priorities, Research Report RS-07-01, Performance Modelling and Engineering Research Group, Department of Computing, University of Bradford, August 2001.
16. H.G. Perros, Queueing Networks with Blocking, Oxford University Press, Oxford, 1994.
17. S. Balsamo, V. De Nitto Persone, R. Onvural, Analysis of Queueing Networks with Blocking, Kluwer Academic Publishers, Dordrecht, 2001.
18. Jaynes E.T., Information theory and statistical mechanics. Phys. Rev. 106:1957;620-630.
19. Jaynes E.T., Information theory and statistical mechanics, Part II. Phys. Rev. 108:1957;171-190.
20. Williams A.C., Bhandiwad R.A., A generating function approach to queueing network analysis of multiprogrammed computers. Networks. 6:1976;1-22.
21. F. Ball, D. Hutchinson, D.D. Kouvatsos, VBR video traffic smoothing at the AAL SAR level, in: D.D. Kouvatsos (Ed.), Proceedings of the Fourth IFIP Workshop on Performance Modelling and Evaluation of ATM Networks, Ilkley, 1996, pp. 28/1-28/10.
22. Onvural R.O., Survey of closed queueing networks with blocking. ACM Comput. Surv. 22(2):1990;83-121.
23. H.G. Perros, Approximation algorithms for open queuing networks with blocking, in: H. Takagi (Ed.), Stochastic Analysis of Computer and Communication Systems, North Holland, Amsterdam, 1990, pp. 451-494.
24. Li S.Q., Overload control in a finite message storage buffer. IEEE Trans. Commun. COMP-37(12):1989;1330-1338.
25. Yin N., Li S.Q., Stern T.E., Congestion control for packet voice by selective packet discarding. IEEE Trans. Commun. 38(5):1990;674-683.
26. H. Kroner, Comparative performance study of space priority mechanisms for ATM networks, in: Proceedings of the IEEE Conference INFOCOM'90, 1989, pp. 1136-1143.
27. D. Hong, T. Suda, Congestion control and prevention in ATM networks, IEEE Network Mag. (1991) 10-16.
28. Bryant R.M., Krzesinskim E., Seetha M., Chandy K.M., The MVA priority approximation. ACM Trans. Comput. Syst. 2:1984;335-359.
29. K.C. Sevcik, Priority scheduling disciplines in queueing network models of computer systems, in: B. Gilchrist (Ed.), Proceedings of the IFIP Congress, 1977, North-Holland, Amsterdam, 1977, pp. 565-570.
30. Kaufman J.S., Approximation methods for networks of queues with priorities. Perform. Evaluation. 4:1984;183-198.
31. J. Zahorjan, E.D. Lazowska, K.C. Sevcik, The use of approximations in production performance evaluation software, in: Proceedings of the International Workshop on Modelling Techniques and Performance Evaluation, Paris, 1987.
32. E.D. Lazowska, J. Zahorjan, K.C. Sevcik, Computer systems performance evaluation using queueing network models, Technical Report, Computer Systems Research Institute, University of Toronto, 86-02-07, 1986.
33. M. Veran, D. Potier, QNAP-2: a portable environment for queueing systems modelling, in: D. Potier (Ed.), Modelling Techniques and Tools for Performance Analysis, North Holland, Amsterdam, 1985, pp. 25-63.
34. Chandy K.M., Herzog U., Woo L., Approximate analysis of general queueing netwoks. IBM J. Res. Dev. 19:1975;43-49.
35. K. Smith, D.D. Kouvatsos, Entropy maximisation and QNM with blocking after service, in: M. Merabti, R. Pereira (Eds.), Proceedings of the Second Annual Postgraduate Symposium on the Convergence of Telecommunications, Networking and Broadcasting (PG Net 2001), Liverpool John Moores University, Liverpool John Moores University Publishers, 2001, pp. 78-83.
36. D.D. Kouvatsos, K. Smith, ME analysis of GE-type queueing networks with blocking after service, Research Report RS-02-03, Performance Modelling and Engineering Research Group, Department of Computing, Bradford University, December 2001.
37. D.D. Kouvatsos, N. Tabet-Aouel, Approximate solutions for networks of queues with multiple server stations under PR discipline, in: P. Harrison, A. Field (Eds.), Proceedings of the Eighth UK Performance Engineering Workshop, Imperial College, September 1992.
38. Kouvatsos D.D., Tabet-Aouel N., An ME-based approximation for multi-server queues with preemptive priority. Eur. J. Oper. Res. 77:1994;496-515.
39. Kouvatsos D.D., Awan I., Fretwell R., Dimakopoulos G., A cost-effective approximation for SRD traffic in arbitrary multi-buffered networks. Comput. Networks. 34(1):2000;97-113.