Abstract: | This paper discusses scheduling of data transmission when data can only be transmitted in one direction at a time. A common policy used is the so-called alternating priority policy. In this paper we select a more general class of policies named the {Si; O} policy. We show how to determine the optimal parameters of the {Si; O} policy for given system parameters. We also give a simple example to show that {Si; O} policy is, in fact, better then alternating priority policy. |