Scheduling data transmission under an {si; o} policy

Vinod K. Sahney

Naval Research Logistics Quarterly, 1972, vol. 19, issue 4, 725-735

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.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800190413

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:19:y:1972:i:4:p:725-735

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().