Earliest deadline message scheduling with limited priority inversion

The paper presents an innovative approach for scheduling network messages with real time dynamic algorithms. The solution described takes advantage of the increased network utilization allowed by dynamic scheduling methods and bounds and at the same time the priority inversion phenomena caused by the lack of a sufficient number of priority levels. We give a very simple formula for checking the schedulability of a set of real time packetized messages, and we show that the penalty introduced by priority inversion can be bounded within a satisfactory predictable range.