Affordable Access

Cycle times in a starlike network with state-dependent routing

Journal of Applied Mathematics and Simulation
Publication Date
  • Computer Science


For a star like network (central server system) with state dependent branching we compute the cycle time distribution. The Laplace-Stieltjes transform of this distribution is of product form. This allows to define a recursive algorithm for evaluation of cycle time moments of any order.

There are no comments yet on this publication. Be the first to share your thoughts.