State transition diagrams for queuing systems and networks When external arrivals are poisson and service times are negative exponential many complex queuing systems and open acyclic queuing networks can be analyzed, even under dynamic conditions, through a udicious choice of state representation This involves writing and solving(often numerically) the steady-state balance equations or the Chapman-Kolmogorov first-order differential equations The"hypercube model"(Chapter 5 is a good example)State transition diagrams for queuing systems and networks • When external arrivals are Poisson and service times are negative exponential, many complex queuing systems and open acyclic queuing networks can be analyzed, even under dynamic conditions, through a judicious choice of state representation • This involves writing and solving (often numerically) the steady-state balance equations or the Chapman-Kolmogorov first-order differential equations • The “hypercube model” (Chapter 5 is a good example)