Adaptive cutoff priority for multiple server system with two kinds of arrival streams

Tatsuya Taniai, Iwao Sasase, Shinsaku Mori

研究成果: Conference contribution

6 引用 (Scopus)

抄録

Adaptive cutoff priority is proposed for a multiple-server finite-capacity buffer system with two kinds of arrival streams in order to reduce the loss probabilities of both kinds of arrivals. It is shown that when the number of low-priority waiting customers is increased, the number of reserved servers for high-priority customers is adaptively decreased by using the adaptive cutoff priority. The state probabilities, which are functions of both the number of customers in the queue and the number of customers in service, are derived, and general expressions for the loss probability and the average queuing time are presented. The numerical calculations are carried out for the finite-capacity buffer system with adaptive cutoff priority and compared with those using conventional cutoff priority in which the number of reserved servers is always fixed. The theoretical results are ensured by the computer simulated results. It is shown that the total loss probability and loss probabilities of both arrivals can be reduced simultaneously if the number of threshold and the threshold values are appropriately selected.

元の言語English
ホスト出版物のタイトルIEEE Global Telecommunications Conference and Exhibition
出版者Publ by IEEE
ページ887-891
ページ数5
2
ISBN(印刷物)0879426322
出版物ステータスPublished - 1990
イベントIEEE Global Telecommunications Conference & Exhibition Part 3 (of 3) - San Diego, CA, USA
継続期間: 1990 12 21990 12 5

Other

OtherIEEE Global Telecommunications Conference & Exhibition Part 3 (of 3)
San Diego, CA, USA
期間90/12/290/12/5

Fingerprint

Servers

ASJC Scopus subject areas

  • Engineering(all)

これを引用

Taniai, T., Sasase, I., & Mori, S. (1990). Adaptive cutoff priority for multiple server system with two kinds of arrival streams. : IEEE Global Telecommunications Conference and Exhibition (巻 2, pp. 887-891). Publ by IEEE.

Adaptive cutoff priority for multiple server system with two kinds of arrival streams. / Taniai, Tatsuya; Sasase, Iwao; Mori, Shinsaku.

IEEE Global Telecommunications Conference and Exhibition. 巻 2 Publ by IEEE, 1990. p. 887-891.

研究成果: Conference contribution

Taniai, T, Sasase, I & Mori, S 1990, Adaptive cutoff priority for multiple server system with two kinds of arrival streams. : IEEE Global Telecommunications Conference and Exhibition. 巻. 2, Publ by IEEE, pp. 887-891, IEEE Global Telecommunications Conference & Exhibition Part 3 (of 3), San Diego, CA, USA, 90/12/2.
Taniai T, Sasase I, Mori S. Adaptive cutoff priority for multiple server system with two kinds of arrival streams. : IEEE Global Telecommunications Conference and Exhibition. 巻 2. Publ by IEEE. 1990. p. 887-891
Taniai, Tatsuya ; Sasase, Iwao ; Mori, Shinsaku. / Adaptive cutoff priority for multiple server system with two kinds of arrival streams. IEEE Global Telecommunications Conference and Exhibition. 巻 2 Publ by IEEE, 1990. pp. 887-891
@inproceedings{a52599d293b64061abd3c6e3bb4faa12,
title = "Adaptive cutoff priority for multiple server system with two kinds of arrival streams",
abstract = "Adaptive cutoff priority is proposed for a multiple-server finite-capacity buffer system with two kinds of arrival streams in order to reduce the loss probabilities of both kinds of arrivals. It is shown that when the number of low-priority waiting customers is increased, the number of reserved servers for high-priority customers is adaptively decreased by using the adaptive cutoff priority. The state probabilities, which are functions of both the number of customers in the queue and the number of customers in service, are derived, and general expressions for the loss probability and the average queuing time are presented. The numerical calculations are carried out for the finite-capacity buffer system with adaptive cutoff priority and compared with those using conventional cutoff priority in which the number of reserved servers is always fixed. The theoretical results are ensured by the computer simulated results. It is shown that the total loss probability and loss probabilities of both arrivals can be reduced simultaneously if the number of threshold and the threshold values are appropriately selected.",
author = "Tatsuya Taniai and Iwao Sasase and Shinsaku Mori",
year = "1990",
language = "English",
isbn = "0879426322",
volume = "2",
pages = "887--891",
booktitle = "IEEE Global Telecommunications Conference and Exhibition",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Adaptive cutoff priority for multiple server system with two kinds of arrival streams

AU - Taniai, Tatsuya

AU - Sasase, Iwao

AU - Mori, Shinsaku

PY - 1990

Y1 - 1990

N2 - Adaptive cutoff priority is proposed for a multiple-server finite-capacity buffer system with two kinds of arrival streams in order to reduce the loss probabilities of both kinds of arrivals. It is shown that when the number of low-priority waiting customers is increased, the number of reserved servers for high-priority customers is adaptively decreased by using the adaptive cutoff priority. The state probabilities, which are functions of both the number of customers in the queue and the number of customers in service, are derived, and general expressions for the loss probability and the average queuing time are presented. The numerical calculations are carried out for the finite-capacity buffer system with adaptive cutoff priority and compared with those using conventional cutoff priority in which the number of reserved servers is always fixed. The theoretical results are ensured by the computer simulated results. It is shown that the total loss probability and loss probabilities of both arrivals can be reduced simultaneously if the number of threshold and the threshold values are appropriately selected.

AB - Adaptive cutoff priority is proposed for a multiple-server finite-capacity buffer system with two kinds of arrival streams in order to reduce the loss probabilities of both kinds of arrivals. It is shown that when the number of low-priority waiting customers is increased, the number of reserved servers for high-priority customers is adaptively decreased by using the adaptive cutoff priority. The state probabilities, which are functions of both the number of customers in the queue and the number of customers in service, are derived, and general expressions for the loss probability and the average queuing time are presented. The numerical calculations are carried out for the finite-capacity buffer system with adaptive cutoff priority and compared with those using conventional cutoff priority in which the number of reserved servers is always fixed. The theoretical results are ensured by the computer simulated results. It is shown that the total loss probability and loss probabilities of both arrivals can be reduced simultaneously if the number of threshold and the threshold values are appropriately selected.

UR - http://www.scopus.com/inward/record.url?scp=0025567140&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025567140&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0025567140

SN - 0879426322

VL - 2

SP - 887

EP - 891

BT - IEEE Global Telecommunications Conference and Exhibition

PB - Publ by IEEE

ER -