A Queuing Envelope Model for Estimating Latency Guarantees in Deterministic Networking Scenarios

TL;DR

This study investigates the approximation of Internet queuing delays using an M/M/1 envelope model, which provides a simple methodology to find tight upper bounds of real delay percentiles in DetNet scenarios where tight latency guarantees need to be assured.

Abstract

Accurate estimation of queuing delays is crucial for designing and optimizing communication networks, particularly in the context of Deterministic Networking (DetNet) scenarios. This study investigates the approximation of Internet queuing delays using an M/M/1 envelope model, which provides a simple methodology to find tight upper bounds of real delay percentiles. Real traffic statistics collected at large Internet Exchange Points (like Amsterdam and San Francisco) have been used to fit polynomial regression models for transforming packet queuing delays into the M/M/1 envelope models. We finally propose a methodology for providing delay percentiles in DetNet scenarios where tight latency guarantees need to be assured.

Figures (3)

• Figure 1: PDF of delay simulated packets (left) their percentiles (right) in one hop
• Figure 2: Relationship between M/G/1 real load and M/M/1 envelope bound
• Figure 3: Comparison of theoretical M/M/1 envelope and simulated M/G/1 delays for AMS-IX traffic distribution