Two parallel queues with dynamic routing under a threshold-type scheduling

Makoto Nakamura, Iwao Sasase, Shinsaku Mori

研究成果: Paper査読

2 被引用数 (Scopus)

抄録

The authors propose two parallel M/M/1 queuing systems with dynamic routing under threshold-type scheduling. An arriving customer is sent to the buffer of the fast server as long as the difference of two queues does not exceed a threshold value: the customer 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 the two parallel M/M/1 queuing systems under threshold-type scheduling can reduce the mean queuing time compared to conventional parallel M/M/1 queuing systems not using the threshold-type policy, and that the mean queuing time is minimized by selecting the threshold value appropriately.

本文言語English
ページ1445-1449
ページ数5
出版ステータスPublished - 1989 12月 1
イベントIEEE Global Telecommunications Conference & Exhibition (GLOBECOM '89). Part 1 (of 3) - Dallas, TX, USA
継続期間: 1989 11月 271989 11月 30

Other

OtherIEEE Global Telecommunications Conference & Exhibition (GLOBECOM '89). Part 1 (of 3)
CityDallas, TX, USA
Period89/11/2789/11/30

ASJC Scopus subject areas

  • 工学(全般)

フィンガープリント

「Two parallel queues with dynamic routing under a threshold-type scheduling」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル