Allocations of Servicing Periods That Minimize Average Delay for N Time-Shared Traffic Streams

In this paper the authors find the optimal allocation of servicing periods to a facility servicing N incoming traffic streams. In our model it is assumed that stream flows are deterministic, that there is a fixed amount of time lost, τi, when the server switches attention from the ith to the i + 1st stream and that the objective is to minimize time average delay.