论文信息 - Bounds for Deterministic Periodic Routing Sequences

Bounds for Deterministic Periodic Routing Sequences

We consider the problem of routing arriving jobs to parallel queues according to a deterministic periodic routing sequence. We introduce a combinatorial notion called the unbalance for such routing sequences. This unbalance is used to obtain an upper bound for the average waiting time of the routed jobs. The best upper bound for given (optimized) routing fractions is obtained when the unbalance is minimized. The problem of minimizing the unbalance is investigated and we show how to construct sequences with small unbalance.

Arie Hordijk | D. A. van der Laan

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

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

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

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

[5] Pierre Arnoux,et al. Complexity of sequences defined by billiard in the cube , 1994 .

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

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

[8] J. F. Ritt. On Certain Points in the Theory of Algebraic Differential Equations , 1938 .

[9] Carl M. Harris,et al. Fundamentals of queueing theory , 1975 .

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

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

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

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

[14] Bruce E. Hajek,et al. The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks , 1983, JACM.