# Bounds on mean cycle time in acyclic fork-join queueing networks

Source: [Bounds on mean cycle time in acyclic fork-join queueing networks](<https://www.sota2.com/research/paper/68fa50041e209131ce967cd6>)

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-07T02:28:17.000Z

## Abstract

Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join networks are derived using the $(\\max,+)$-algebra approach. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented.

## 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.1521>)

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