IEICE TRANSACTIONS on transactions
Two Parallel Queues with Dynamic Routing under a Threshold-Type Scheduling
Summary :
In this paper, we propose two parallel M/M/1 queueing systems with dynamic routing under a threshold-type scheduling. Arriving customer is sent to the buffer of the faster server as far as the difference of two queues does not exceed a threshold value, but it should be sent to the buffer of the slower server if and only if the difference of two queues exceeds a threshold value. It is shown that as the difference of the two service rates becomes large, the two parallel M/M/1 queueing systems with dynamic routing under the threshold-type scheduling can reduce the mean queueing time of costomers in the system compared to the conventional nonthreshold-type one. It is also found that as the asymmetry in the two service rates increases, the optimum threshold value which minimizes the mean queueing time should be large to reduce the number of queueing customer in the buffer of the slower server. On the other hand, as the traffic intensity becomes large, the optimum threshold value tends to be small in order to increase the total service rate.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E73-E No.3 pp.379-385
- Publication Date
- 1990/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Communication Networks and Services
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Makoto NAKAMURA, Iwao SASASE, Shinsaku MORI, "Two Parallel Queues with Dynamic Routing under a Threshold-Type Scheduling" in IEICE TRANSACTIONS on transactions,
vol. E73-E, no. 3, pp. 379-385, March 1990, doi: .
Abstract: In this paper, we propose two parallel M/M/1 queueing systems with dynamic routing under a threshold-type scheduling. Arriving customer is sent to the buffer of the faster server as far as the difference of two queues does not exceed a threshold value, but it should be sent to the buffer of the slower server if and only if the difference of two queues exceeds a threshold value. It is shown that as the difference of the two service rates becomes large, the two parallel M/M/1 queueing systems with dynamic routing under the threshold-type scheduling can reduce the mean queueing time of costomers in the system compared to the conventional nonthreshold-type one. It is also found that as the asymmetry in the two service rates increases, the optimum threshold value which minimizes the mean queueing time should be large to reduce the number of queueing customer in the buffer of the slower server. On the other hand, as the traffic intensity becomes large, the optimum threshold value tends to be small in order to increase the total service rate.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e73-e_3_379/_p
Copy
@ARTICLE{e73-e_3_379,
author={Makoto NAKAMURA, Iwao SASASE, Shinsaku MORI, },
journal={IEICE TRANSACTIONS on transactions},
title={Two Parallel Queues with Dynamic Routing under a Threshold-Type Scheduling},
year={1990},
volume={E73-E},
number={3},
pages={379-385},
abstract={In this paper, we propose two parallel M/M/1 queueing systems with dynamic routing under a threshold-type scheduling. Arriving customer is sent to the buffer of the faster server as far as the difference of two queues does not exceed a threshold value, but it should be sent to the buffer of the slower server if and only if the difference of two queues exceeds a threshold value. It is shown that as the difference of the two service rates becomes large, the two parallel M/M/1 queueing systems with dynamic routing under the threshold-type scheduling can reduce the mean queueing time of costomers in the system compared to the conventional nonthreshold-type one. It is also found that as the asymmetry in the two service rates increases, the optimum threshold value which minimizes the mean queueing time should be large to reduce the number of queueing customer in the buffer of the slower server. On the other hand, as the traffic intensity becomes large, the optimum threshold value tends to be small in order to increase the total service rate.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Two Parallel Queues with Dynamic Routing under a Threshold-Type Scheduling
T2 - IEICE TRANSACTIONS on transactions
SP - 379
EP - 385
AU - Makoto NAKAMURA
AU - Iwao SASASE
AU - Shinsaku MORI
PY - 1990
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E73-E
IS - 3
JA - IEICE TRANSACTIONS on transactions
Y1 - March 1990
AB - In this paper, we propose two parallel M/M/1 queueing systems with dynamic routing under a threshold-type scheduling. Arriving customer is sent to the buffer of the faster server as far as the difference of two queues does not exceed a threshold value, but it should be sent to the buffer of the slower server if and only if the difference of two queues exceeds a threshold value. It is shown that as the difference of the two service rates becomes large, the two parallel M/M/1 queueing systems with dynamic routing under the threshold-type scheduling can reduce the mean queueing time of costomers in the system compared to the conventional nonthreshold-type one. It is also found that as the asymmetry in the two service rates increases, the optimum threshold value which minimizes the mean queueing time should be large to reduce the number of queueing customer in the buffer of the slower server. On the other hand, as the traffic intensity becomes large, the optimum threshold value tends to be small in order to increase the total service rate.
ER -
English
