The Effect of Varying Routing Probability in Two Parallel Queues with Dynamic Routing under a Threshold-Type Scheduling

Takashi KOJIMA  Makoto NAKAMURA  Iwao SASASE  Shinsaku MORI  

IEICE TRANSACTIONS on Communications   Vol.E74-B   No.9   pp.2772-2778
Publication Date: 1991/09/25
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Communication Networks and Service

Full Text: PDF>>
Buy this Article

In this paper we consider the effect of varying routing probability in two parallel M/M/1 queueing systems with dynamic routing under a threshold type scheduling. We also estimate the effect of varying routing probability as well as threshold on the resequencing delay. First we obtain the general expression for state probabilities. Next we estimate the effect of varying routing probability by the numerical calculation and the computer simulation. It is shown that the mean queueing delay can be reduced by varying the routing probability appropriately. Varying the routing probability together with the threshold-type scheduling is more effective to reduce the queueing delay in the variation of the traffic intensity. And besides it is shown that the resequencing delay can be reduced in the wide region of the traffic intensity by employing the optimal threshold and routing probability.