The Mathematics RANDOLPH IBM 10598 Research of Product Form Queuing Networks D. NELSON Division, T. J. Watson Research Center, P. O. Box 704, Room H2-D26, Yorktou,n Heights, NY Markov computer seemingly established to provide form and processes complex insight compamon that have a product tool. processes balance such such form The fact solution that have such at first become encounter In this an important solutlon and that balance article exists for can be we attempt product are Notions the performance by showing modeling Markov that results, properties reversibility, a simple M surprlsmg equations form arrwal by queues are satisfied. exists theorem that as to why a solution as the and demonstrate and satisfy Norton s partial theorem, to establish consequences of reverse four properties. of four satisfied processes, and quasireversibility are developed Categories Performance Probability General Additional and Subject and Statistics; Terms: Descriptors: C,4 [Computer techniques; of Systems modelmg Systems Organization]: G.3 [Mathematics of Computing]: Simulation and Modeling 1.6 [Computing Methodologies]: Performance and Phrases: theory, Networks, reversibility partial balance, product form, Key Words quasireverslbdity, queuing 1. INTRODUCTION The discovery that certain queuing networks have tractable product form solutions [Baskett et al. 1975; Gordon and Newell 1967; Jackson 1963;
/lp/association-for-computing-machinery/the-mathematics-of-product-form-queuing-networks-WMNs24CWfR