Procedure and system for scheduling a shared recourse between multiple information packet flows

Abstract

Each synchronous flow (h=1, 2, N) is associated to a respective synchronous capacity value (H) indicative of the maximum amount of time for which a synchronous flow can be served before relinquishing the token. Each asynchronous flow (I=1, 2, N) is, on the other hand, associated to a respective indicative value of the delay to be recovered so that the respective queue has the right to be served and to another value indicating the instant in which the server visited the respective queue in the pervious cycle. Each queue associated to a synchronous flow (h) is therefore served for a maximum amount of time that is equal to the aforesaid synchronous capacity value, while each queue associated to an asynchronous flow (i) is only served if the server's visit takes place with anticipation with respect to the expected instant. This anticipation is determined as the difference between the expected rotation time, needed by the server () to complete a visit cycle (T) of the queues associated to the aforesaid flows (h, i), and the time that has passed since the server's previous visit () and the delay accumulated. This difference, if positive, defines the maximum service time for the asynchronous queue. If the queue is empty when the server visits it, the server () moves on to the next queue even before the relative maximum service time has passed.