We analyze the queueing behavior of long-tailed traffic flows under the Generalized Processor Sharing (GPS) discipline. We show a sharp dichotomy in qualitative behavior, depending on the relative values of the weight parameters. For certain weight combinations, an individual flow with long-tailed traffic characteristics is effectively served at a constant rate. The effective service rate may be interpreted as the maximum average rate for the flow to be stable, which is only influenced by the traffic characteristics of the other flows through their average rates. In particular, the flow is essentially immune from excessive activity of flows with `heavier'-tailed traffic characteristics. In many situations, the effective service rate is simply the link rate reduced by the aggregate average rate of the other flows. This confirms that GPS-based scheduling algorithms provide a potential mechanism for extracting significant multiplexing gains, while isolating individual flows. For other weight combinations however, a flow may be strongly affected by the activity of `heavier'-tailed flows, and may inherit their traffic characteristics, causing induced burstiness. The stark contrast in qualitative behavior illustrates the crucial importance of the weight parameters.

, , ,
CWI. Probability, Networks and Algorithms [PNA]

Borst, S., Boxma, O., & Jelenkovic, P. R. (2000). Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows. CWI. Probability, Networks and Algorithms [PNA]. CWI.