Frame-bound priority scheduling in discrete-time queueing systems (Q656439)

The authors suggest a solution of the starvation problem of a delay-tolerant traffic in modern packet-based communication networks with priorities. When traffic loads are high, the low priority delay-tolerant traffic can suffer long waiting periods because high priority packets enter the queue at the head of line. It is suggested to divide the time axes in time-frames and let a high-priority packet overtake low-priority packets within the same time-frame only. Grouping packets belonging to the same frame, the authors use matrix analytical technique and generating functions (GF) to analyze system performance in stationary regime, in particular, the obtain GF for delays related to different priorities. Numerical results show the effect of the frame size on the delay differentiation between customers of distinct classes.