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

Makoto Nakamura, Iwao Sasase, Shinsaku Mori

Research output: Contribution to conferencePaper

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages1445-1449
Number of pages5
Publication statusPublished - 1989 Dec 1
EventIEEE Global Telecommunications Conference & Exhibition (GLOBECOM '89). Part 1 (of 3) - Dallas, TX, USA
Duration: 1989 Nov 271989 Nov 30

Other

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

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Nakamura, M., Sasase, I., & Mori, S. (1989). Two parallel queues with dynamic routing under a threshold-type scheduling. 1445-1449. Paper presented at IEEE Global Telecommunications Conference & Exhibition (GLOBECOM '89). Part 1 (of 3), Dallas, TX, USA, .