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

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

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E74-B No.9 pp.2772-2778

Publication Date: 1991/09/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Communication Networks and Service

Authors

Takashi KOJIMA
Makoto NAKAMURA
Iwao SASASE
Shinsaku MORI

Keyword

Cite this

Copy

Takashi KOJIMA, Makoto NAKAMURA, Iwao SASASE, Shinsaku MORI, "The Effect of Varying Routing Probability in Two Parallel Queues with Dynamic Routing under a Threshold-Type Scheduling" in IEICE TRANSACTIONS on Communications, vol. E74-B, no. 9, pp. 2772-2778, September 1991, doi: .
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e74-b_9_2772/_p

Copy

@ARTICLE{e74-b_9_2772,
author={Takashi KOJIMA, Makoto NAKAMURA, Iwao SASASE, Shinsaku MORI, },
journal={IEICE TRANSACTIONS on Communications},
title={The Effect of Varying Routing Probability in Two Parallel Queues with Dynamic Routing under a Threshold-Type Scheduling},
year={1991},
volume={E74-B},
number={9},
pages={2772-2778},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={September},}

Copy

TY - JOUR
TI - The Effect of Varying Routing Probability in Two Parallel Queues with Dynamic Routing under a Threshold-Type Scheduling
T2 - IEICE TRANSACTIONS on Communications
SP - 2772
EP - 2778
AU - Takashi KOJIMA
AU - Makoto NAKAMURA
AU - Iwao SASASE
AU - Shinsaku MORI
PY - 1991
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E74-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 1991
AB - 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.
ER -