10.4. 10.4. Queueing Softwares

To solve practical problems the first step is to identify the appropriate queueing system and then to calculate the performance measures. Of course the level of modeling heavily depends on the assumptions. It is recommended to start with a simple system and then if the results do not fit to the problem continue with a more complicated one. Various software packages help the interested readers in different level. The following links worths a visit

  http://web2.uwindsor.ca/math/hlynka/qsoft.html  

For practical oriented teaching courses we also have developed a collection of Java-applets calculating the performance measures not only for elementary but for more advanced queueing systems. It is available at

  http://irh.inf.unideb.hu/user/jsztrik/education/03/EN  

For simulation purposes I recommend

  http://www.win.tue.nl/cow/Q2/  

If the preprepared systems are not suitable for your problem then you have to create your queueing system and then the creation starts and the primary aim of the present book is to help this process.

For further readings the interested reader is referred to the following books: Allen [ 2 ], Bose [ 9 ], Daigle [ 18 ], Gnedenko and Kovalenko [ 31 ], Gnedenko, Belyayev and Solovyev [ 29 ], Gross and Harris [ 32 ], Jain [ 41 ], Jereb and Telek [ 43 ], Kleinrock [ 48 ], Kobayashi [ 50 ],[ 51 ], Kulkarni [ 54 ], Nelson [ 59 ], Stewart [ 74 ], Sztrik [ 81 ], Tijms [ 91 ], Trivedi [ 94 ].

The present book has used some parts of Allen [ 2 ], Gross and Harris [ 32 ], Kleinrock [ 48 ], Kobayashi [ 50 ], Sztrik [ 81 ], Tijms [ 91 ], Trivedi [ 94 ].