Adaptive Cutoff Priority for Multiple Server System with Two Kinds of Arrival Streams

Tatsuya TANIAI; Iwao SASASE; Sinsaku MORI

Adaptive Cutoff Priority for Multiple Server System with Two Kinds of Arrival Streams

Tatsuya TANIAI, Iwao SASASE, Sinsaku MORI

Full Text Views

0

Cite this

Summary :

In this paper, we propose the adaptive cutoff priority for a multiple server finite-capacity buffer system with two kinds of arrival streams to reduce loss probabilities of both kinds of arrivals. The number of reserved" servers for high priority customers is adaptively decreased by using the adaptive cutoff priority, when the number of waiting customers of low priority is increased. We first derive the state probabilities which are the function of both the number of customers in the queue and the number of customers in service, so that it is possible to present general expressions for the loss probability and the average queueing time. Next, the numerical calculation is carried out and it is found that not only the loss probability of each arrival but slso the total loss probability are reduced by using more than two thresholds and selecting the treshold values appropriately. It is shown that the computer simulated results agree with the theoretical results.

Publication: IEICE TRANSACTIONS on transactions Vol.E73-E No.10 pp.1688-1695

Publication Date: 1990/10/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Communication Theory and Its Applications)

Category: Transport System

Authors

Tatsuya TANIAI
Iwao SASASE
Sinsaku MORI

Keyword

Cite this

Copy

Tatsuya TANIAI, Iwao SASASE, Sinsaku MORI, "Adaptive Cutoff Priority for Multiple Server System with Two Kinds of Arrival Streams" in IEICE TRANSACTIONS on transactions, vol. E73-E, no. 10, pp. 1688-1695, October 1990, doi: .
Abstract: In this paper, we propose the adaptive cutoff priority for a multiple server finite-capacity buffer system with two kinds of arrival streams to reduce loss probabilities of both kinds of arrivals. The number of reserved" servers for high priority customers is adaptively decreased by using the adaptive cutoff priority, when the number of waiting customers of low priority is increased. We first derive the state probabilities which are the function of both the number of customers in the queue and the number of customers in service, so that it is possible to present general expressions for the loss probability and the average queueing time. Next, the numerical calculation is carried out and it is found that not only the loss probability of each arrival but slso the total loss probability are reduced by using more than two thresholds and selecting the treshold values appropriately. It is shown that the computer simulated results agree with the theoretical results.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e73-e_10_1688/_p

Copy

@ARTICLE{e73-e_10_1688,
author={Tatsuya TANIAI, Iwao SASASE, Sinsaku MORI, },
journal={IEICE TRANSACTIONS on transactions},
title={Adaptive Cutoff Priority for Multiple Server System with Two Kinds of Arrival Streams},
year={1990},
volume={E73-E},
number={10},
pages={1688-1695},
abstract={In this paper, we propose the adaptive cutoff priority for a multiple server finite-capacity buffer system with two kinds of arrival streams to reduce loss probabilities of both kinds of arrivals. The number of reserved" servers for high priority customers is adaptively decreased by using the adaptive cutoff priority, when the number of waiting customers of low priority is increased. We first derive the state probabilities which are the function of both the number of customers in the queue and the number of customers in service, so that it is possible to present general expressions for the loss probability and the average queueing time. Next, the numerical calculation is carried out and it is found that not only the loss probability of each arrival but slso the total loss probability are reduced by using more than two thresholds and selecting the treshold values appropriately. It is shown that the computer simulated results agree with the theoretical results.},
keywords={},
doi={},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - Adaptive Cutoff Priority for Multiple Server System with Two Kinds of Arrival Streams
T2 - IEICE TRANSACTIONS on transactions
SP - 1688
EP - 1695
AU - Tatsuya TANIAI
AU - Iwao SASASE
AU - Sinsaku MORI
PY - 1990
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E73-E
IS - 10
JA - IEICE TRANSACTIONS on transactions
Y1 - October 1990
AB - In this paper, we propose the adaptive cutoff priority for a multiple server finite-capacity buffer system with two kinds of arrival streams to reduce loss probabilities of both kinds of arrivals. The number of reserved" servers for high priority customers is adaptively decreased by using the adaptive cutoff priority, when the number of waiting customers of low priority is increased. We first derive the state probabilities which are the function of both the number of customers in the queue and the number of customers in service, so that it is possible to present general expressions for the loss probability and the average queueing time. Next, the numerical calculation is carried out and it is found that not only the loss probability of each arrival but slso the total loss probability are reduced by using more than two thresholds and selecting the treshold values appropriately. It is shown that the computer simulated results agree with the theoretical results.
ER -