Algorithm for Queueing Networks With Multi-Rate Traffic
In this paper, the authors present a new algorithm for evaluating queueing networks with multi-rate traffic. The detailed state space of a node is evaluated by explicit formula. They consider reversible nodes with multi-rate traffic and find the state probabilities by taking advantage of local balance. Theory of queueing networks in general, presumes that they have product form between the nodes. Otherwise, they have the state space explosion. Even so, the detailed state space of each node may become very large because there is no product form between chains inside a node. A prerequisite for product form is reversibility which implies that the arrival process and departure process are identical processes, for example state-dependent Poisson processes.