Further results on a new combined strategy based on the SRPT-principle

The method used for analyzing the combined shortest remaining processing time first/round robin (SRPT/RR) strategy is briefly introduced, and it is shown that this combined strategy preserves the essential advantages of the SRPT principle. In data communications, this strategy potentially may be applied to the packet switching process. The packet length corresponds to the time slice, and overhead corresponds mainly to the packet frame because most of the operations needed to organize the queue can be performed in parallel. In networks with virtual or static routing, this strategy selects the next packet of the message with the least number of remaining packets; for an equal number of remaining packets, the message with the shortest last packet is chosen. The first in, first out (FIFO) rule is used to resolve any remaining ambiguity. Local area networks are a special area of application for this strategy