Title :
Two parallel queues with dynamic routing under a threshold-type scheduling
Author :
Nakamura, Makoto ; Sasase, Iwao ; Mori, Shinsaku
Author_Institution :
Dept. of Electr. Eng., Keio Univ., Yokohama, Japan
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
Keywords :
computer networks; packet switching; queueing theory; scheduling; telecommunication traffic; dynamic routing; mean queueing time reduction; packet switching data networks; parallel M/M/1 queuing systems; slow/fast server buffer; threshold-type scheduling; Application software; Artificial intelligence; Communication switching; Communication system control; Computer applications; Control system analysis; Dynamic scheduling; Optimal control; Packet switching; Routing;
Conference_Titel :
Global Telecommunications Conference and Exhibition 'Communications Technology for the 1990s and Beyond' (GLOBECOM), 1989. IEEE
Conference_Location :
Dallas, TX
DOI :
10.1109/GLOCOM.1989.64188
