A Priority Buffer Insertion Ring Protocol For Local Area Networks

Abstract

This paper presents a new buffer insertion ring protocol with message-based priorities. A new arrangement of buffers and processes combined with a binary sort algorithm allows for priority- based queuing of messages without sorting delay. A model showing performance of the new system is presented. A new variable, the load factor, is defined and used in the performance model and for simplification of computer simulation. Data generated from computer simulation show that delay-throughput characteristics of high-priority messages are superior to those of non-message-priori ty system. Data provide comparisons of number of priority levels, performance of each priority level, effect of operating modes on performance, and the dual impact of implementation of priority sorting and high network load.