DESIGN AND ANALYSIS OF (M/G/1):(GD/ infinity / infinity ) AND (M sub( i)/G sub( i) /l):(NPRP/ infinity / infinity ) QUEUEING SYSTEMS

There are many non Poisson queuing models. This article mainly deals with the analysis of Non-Poisson queues. The feasibility of the system is analyzed based on the numerical calculations and Graphical representations. When the mean system size and the queue size is high, optimized value is obtained, so that the total expected cost is minimized. The outline here an approach that may be used to analyze a non Poisson model, which has job classes of multiple priorities. The priority discipline followed may be either non-preemptive or preemptive in nature. Note that there may be loss of work in the preemptive non-resume priority case. Such loss of work will not happen in the case of the other two priorities. Since the service times are assumed to be exponentially distributed, they will satisfy the memory-less property and that, therefore, the results will be the same both for the preemptive resume and preemptive non-resume cases.