Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join networks are derived using the (max,+)-algebra approach.

In max-plus algebra, some algorithms for determining the eigenvector of irreducible matrices are power algorithm and Kleene star algorithm. this research, a modified will be discussed to compensate disadvantages The algorithm’s time complexity is O(n(n!)), new O(n4), while cannot calculated. This research also applies algebra in railroad network scheduling problem, constructing graphical user i...

The network calculus is a framework for the analysis of communication net-works, which exploits that many computer network models become tractablefor analysis if they are expressed in a min-plus or max-plus algebra. In amin-plus algebra, the network calculus characterizes amounts of traffic andavailable service as functions of time. In a max-plus algebra, the network cal-cul...