Curious properties of latency distributions

TL;DR

This paper explores the algebraic properties of network latency distributions, providing a mathematical framework and Haskell implementation to model capacity-insensitive processes and distributed systems.

Contribution

It introduces a novel algebraic approach to modeling latency distributions and offers practical Haskell code for implementation.

Findings

Identifies algebraic properties of latency distributions

Provides a formal model for capacity-insensitive processes

Includes Haskell code for practical application

Abstract

Network latency distributions, their algebra, and use examples. This paper considers modeling of capacity-insensitive processes and distributed systems. It provides algebraic properties of the latency distribution algebra and Haskell code to implement the model.