ABSTRACT
Repeatedly we are haunted with the question: Theory or not, can we lay our hands on numerically computable queueing characteristics? Of course, theory has helped and guided us in our pursuit, sometimes directly and sometimes indirectly. Nevertheless, our quest for computable solutions has led us to separately consider this problem in Chapter 4 and as a consequence, quite a few novel and interesting ideas and procedures are revealed to us, most of which have no direct resemblance with materials of Chapters 2 and 3. Continuing in the same vein, the present chapter deals with more computational methods, in some way as extensions of earlier concepts. But remarkable enough, they cover models for which theoretical treatments are not easily available.
