Bounds for Deterministic Periodic Routing Sequences

Authors:
Arie Hordijk;D. A. van der Laan
Affiliations:
-;-
Venue:
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Year:
2001

Citing 6
Cited 0

The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks

Journal of the ACM (JACM)
Balanced sequences and optimal routing

Journal of the ACM (JACM)
Multimodularity, Convexity, and Optimization Properties

Mathematics of Operations Research
Fraenkel's conjecture for six sequences

Discrete Mathematics
Optimal Load Balancing on Distributed Homogeneous Unreliable Processors

Operations Research
Routing Jobs to Servers with Deterministic Service Times

Mathematics of Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.