# The max-plus algebra approach in modelling of queueing networks

Source: [The max-plus algebra approach in modelling of queueing networks](<https://www.sota2.com/research/paper/68fa50061e209131ce96802d>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2026-06-04T05:01:55.649Z

Authors: Nikolai K. Krivulin

Published: 2012-12-04T22:21:24.000Z

## Abstract

A class of queueing networks which consist of single-server fork-join nodes with infinite buffers is examined to derive a representation of the network dynamics in terms of max-plus algebra. For the networks, we present a common dynamic state equation which relates the departure epochs of customers from the network nodes in an explicit vector form determined by a state transition matrix. We show how the matrix may be calculated from the service time of customers in the general case, and give examples of matrices inherent in particular networks.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1212.0895>)

[PDF](<https://arxiv.org/pdf/1212.0895.pdf>)
