The unbalance and bounds on the average waiting time for periodic routing to one queue
- 40 Downloads
In this paper we introduce the combinatorial notion of unbalance for a periodic zero-one splitting sequence. Using this unbalance we derive an upper bound for the average expected waiting time of jobs which are routed to one queue according to a periodic zero-one splitting sequence. In the companion paper  the upper bound will be extended to the routing to N parallel queues.
Unable to display preview. Download preview PDF.