We present a model of performance bound calculus on feedforward networks
where data packets are routed under wormhole routing discipline. We are
interested in determining maximum end-to-end delays and backlogs of messages or
packets going from a source node to a destination node, through a given virtual
path in the network. Our objective here is to give a network calculus approach
for calculating the performance bounds. First we propose a new concept of
curves that we call packet curves.
Traffic on a circular road is described by dynamic programming equations
associated to optimal control problems. By solving the equations analytically,
we derive the relation between the average car density and the average car
flow, known as the fundamental diagram of traffic. First, we present a model
based on min-plus algebra, then we extend it to a stochastic dynamic
programming model, then to a stochastic game model. The average car flow is
derived as the average cost per time unit of optimal control problems, obtained
in terms of the average car density.
This is a technical note where we solve the additive eigenvalue problem
associated to a dynamics of a 2D-traffic system. The traffic modeling is not
explained here. It is available in \cite{Far08}. It consists of a microscopic
road traffic model of two circular roads crossing on one junction managed with
the priority-to-the-right rule.