A priority based service algorithm for use in time-critical and integrated services networks

This paper proposes and analyses a simple and efficient means for the allocation of service rates to traffic of different priorities arriving at the receive buffer of the processing nodes in a network. It is shown that the technique exhibits advantages over the first-come first-served buffer service algorithm making it suitable for networks in time critical control applications and integrated services network applications where extremely fast and deterministic response times are required. In this paper, however, the analysis is presented in the context of time critical control applications.