On the Average Waiting Time for Regular Routing to Deterministic Queues

We consider a deterministic queueing system in whichN = 2 servers of different speeds operate in parallel. Each service in queuei takes the deterministic timeS i. Identical customers arrive exactly one per time unit, and it is desirable to route them to the queues so that the average waiting time (we consider as waiting time the time a customer waits in the buffer of a queue, and thus the service time is not included in this) is minimized. We provide an algorithm to compute lower and upper bounds on this quantity. The upper bound is found by showing that there is a periodic policy for which the average waiting time is no greater than the lower bound plus ( N / 2) - 1. Thus, the bounds coincide whenN = 2. For obtaining the lower bound, we give explicit formulae for the average waiting time in case of regular routing to a deterministic queue.

[1]  Dinard van der Laan.  Routing Jobs to Servers with Deterministic Service Times , 2005, Math. Oper. Res..

[2]  Masaaki Kijima,et al.  Evaluation of regular splitting queues , 1989 .

[3]  François Baccelli,et al.  Elements Of Queueing Theory , 1994 .

[4]  M. Draeger,et al.  O. Perron (o. Prof. a. d. Univ. München), Die Lehre von den Kettenbrüchen, Bd. I. 3. erw. u. neubearb, Aufl. VI + 194 S. Stuttgart 1954. B. G. Teubner Verlagsgesellschaft. Preis geb. 29.40 DM , 1955 .

[5]  M. Lothaire,et al.  Algebraic Combinatorics on Words: Index of Notation , 2002 .

[6]  P. A. P. Moran,et al.  An introduction to probability theory , 1968 .

[7]  Shaler Stidham,et al.  Technical Note - A Last Word on L = λW , 1974, Oper. Res..

[8]  Eitan Altman,et al.  Admission control in stochastic event graphs , 2000, IEEE Trans. Autom. Control..

[9]  Eitan Altman,et al.  Multimodularity, Convexity, and Optimization Properties , 2000, Math. Oper. Res..

[10]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[11]  Robert Tijdeman.  Fraenkel's conjecture for six sequences , 2000, Discret. Math..

[12]  M. Lothaire.  Algebraic Combinatorics on Words , 2002 .

[13]  Arie Hordijk,et al.  NOTE ON THE CONVEXITY OF THE STATIONARY WAITING TIME AS A FUNCTION OF THE DENSITY , 2003, Probability in the Engineering and Informational Sciences.

[14]  Arie Hordijk,et al.  The unbalance and bounds on the average waiting time for periodic routing to one queue , 2004, Math. Methods Oper. Res..

[15]  Eitan Altman,et al.  Balanced sequences and optimal routing , 2000, JACM.

[16]  Arie Hordijk,et al.  Periodic routing to parallel queues and billiard sequences , 2004, Math. Methods Oper. Res..

[17]  Bruno Gaujal,et al.  Optimal Routing Policy in Two Deterministic Queues , 2000 .

[18]  G. A. Hedlund,et al.  Symbolic Dynamics II. Sturmian Trajectories , 1940 .

[19]  Bruce E. Hajek,et al.  Extremal Splittings of Point Processes , 1985, Math. Oper. Res..

[20]  Yair Arian,et al.  Algorithms for generalized round robin routing , 1992, Oper. Res. Lett..

[21]  Eitan Altman,et al.  Discrete-Event Control of Stochastic Networks - Multimodularity and Regularity , 2004, Lecture notes in mathematics.

[22]  Onno J. Boxma,et al.  Optimization of Static Traffic Allocation Policies , 1994, Theor. Comput. Sci..

[23]  Ger Koole,et al.  On the Assignment of Customers to Parallel Queues , 1992, Probability in the Engineering and Informational Sciences.

[24]  P. Sparaggis,et al.  Minimizing response times and queue lengths in systems of parallel queues , 1999 .

[25]  Arie Hordijk,et al.  Bounds for Deterministic Periodic Routing Sequences , 2001, IPCO.

[26]  Zhen Liu,et al.  Optimal Load Balancing on Distributed Homogeneous Unreliable Processors , 1998, Oper. Res..