For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
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
Publication Date: 1991/09/25
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Communication Networks and Service
Full Text: PDF(477.2KB)>>
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.