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

TL;DR

This paper introduces a queuing envelope model based on M/M/1 processes to accurately estimate latency bounds in deterministic networking, using real Internet traffic data for improved delay guarantees.

Contribution

It presents a novel methodology combining real traffic data with M/M/1 envelope models to provide tight latency bounds in deterministic networking scenarios.

Findings

M/M/1 envelope models fit real Internet delay data well

Polynomial regression effectively transforms real delays into model parameters

Proposed method offers reliable delay percentile estimates for DetNet

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.