Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
The paper deals with network routing in generalized open queuing networks (OQN). Most studies in the literature assume Poissonian hypotheses to route flows in OQN. Poissonian assumptions are not suitable for analysis of flows in generalized OQN. We merge routing and approximate decomposition in a multicommodity flow algorithm. The proposed algorithm leads to much more accurate flow routing in generalized OQN.
approximate decomposition methods multicommodity flows queuing networks generalized open queuing networks