[Starlink] Finite-Buffer M/G/1 Queues with Time and Space Priorities

[Bless, Roland (TM)]

Hi Dave,

IMHO the problem w.r.t the applicability of most models from
queueing theory is that they only work for load < 1, whereas
we are using the network with load values ~1 (i.e., around one) due to 
congestion control feedback loops that drive the bottleneck link
to saturation (unless you consider application limited traffic sources).
So I'm not sure that you can expect interesting results from these
kind of models to understand FQ-codel 's behavior w.r.t. to "real
traffic". So it also depends on how accurately one can model the real
traffic source aggregate that is actually a mixture of short-lived and
longer-lived flows with a CC feedback loop.

Regards,
  Roland

On 27.07.22 at 17:34 Dave Taht via Starlink wrote:
> Occasionally I pass along a recent paper that I don't understand in
> the hope that someone can enlighten me.
> This is one of those occasions, where I am trying to leverage what I
> understand of existing FQ-codel behaviors against real traffic.
> 
> https://www.hindawi.com/journals/mpe/2022/4539940/
> 
> Compared to the previous study on finite-buffer M/M/1 priority queues
> with time and space priority, where service times are identical and
> exponentially distributed for both types of traffic, in our model we
> assume that service times are different and are generally distributed
> for different types of traffic. As a result, our model is more
> suitable for the performance analysis of communication systems
> accommodating multiple types of traffic with different service-time
> distributions. For the proposed queueing model, we derive the
> queue-length distributions, loss probabilities, and mean waiting times
> of both types of traffic, as well as the push-out probability of
> delay-sensitive traffic.