Analysis of Dynamical Queue Scheduling Algorithm with Service Loop Duration Restriction for Network Services

Queue dynamical scheduling algorithms are proposed for network switches supporting Quality of Service and making fewer jitter values spread while forwarding different QoS classes traffic and reaching more comfortable conditions for traffic transferring in case of misbalancing of granted for Classes of Service bandwidth. This is by means of continuous data transferring time restriction while each queue handled and of mixing different QoS traffic head frames which makes self-similarity less. Proposed algorithms are based on Deficit Round Robin (DRR) algorithm with chosen queue continuous handling session division onto a set of sub-sessions by means of periodical transmitting of special delimiting frame that is either the oldest frame from non-empty queues or chosen from random non-empty queue head frame or from the queue with the following pruning value. Sizes of transmitted delimitation frames are accounted for set deficits of respective queues. Proposed algorithms efficiency is asserted toward known algorithms, i.e. cyclic, stochastic, time selection algorithm, which is by means of simulation modeling of the algorithms and hierarchical colored Petri nets apparatus usage and means of CPN Tools packet. As criteria it is considered the values of variation of maximum and average values of traffic jitter for various Classes of Service.