

Here is a quick list of the types of queueing networks that can be solved using QNAT -
Our distribution includes documentation on the analytical techniques that have been used. This has been provided through a Microsoft Word file that is a part of this distribution. The documentation provides a summary of the actual algorithm used by each solution technique in QNAT and examples of networks solved using this technique in QNAT. These examples may be found in the samples distributed with QNAT.
Home Page: of QNAT: http://poisson.ecse.rpi.edu/~hema/qnat/Given the hitting time distribution of a finite absorbing Markov chain we find the initial probability distribution vector a and the transition matrix T, such that T is quasi- bi-diagonal with a number of backward transitions that equals the number of complex pole pairs of the Laplace- Stieljes transform of the distribution. We call such a representation a Mixture of Monocyclic Erlang distributions (MME).
The software and some user instructions are available at:
http://www.multimania.com/mocanu/
(recommended for France) or
http://www.fortunecity.com/skyscraper/solaris/191/
(world-wide).
Source files are available on request.
In order to use the software you must have Windows 95 or Windows NT
installed on your computer.
If you have download problems, or for any other problems, contact
mocanu@lag.ensieg.inpg.fr
Stefan Mocanu
Laboratoire D'Automatique de Grenoble,
ENSIEG, B.P. 46,
38402 Saint Martin d'Heres
e-mail: mocanu@lag.ensieg.inpg.fr
telephone: + 33 4 76 82 64 18
telecopie: + 33 4 76 82 63 88
http://csp.ensieg.inpg.fr/jeunes/francais/liste/mocanu-fr.html
LAG: http://www-lag.ensieg.inpg.fr
MoMI Home Page: http://www.multimania.com/mocanu/
http://www.fortunecity.com/skyscraper/solaris/191/