# Products of random matrices and queueing system performance evaluation

Source: [Products of random matrices and queueing system performance evaluation](<https://www.sota2.com/research/paper/68fa50041e209131ce967d66>)

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

Data updated: 2026-06-04T05:02:01.984Z

Authors: N. K. Krivulin

Published: 2012-12-20T22:45:52.000Z

## Abstract

We consider (max,+)-algebra products of random matrices, which arise from performance evaluation of acyclic fork-join queueing networks. A new algebraic technique to examine properties of the product and investigate its limiting behaviour is proposed based on an extension of the standard matrix (max,+)-algebra by endowing it with the ordinary matrix addition as an external operation. As an application, we derive bounds on the (max,+)-algebra maximal Lyapunov exponent which can be considered as the cycle time of the 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.5291>)

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