When the steady-state joint probability of the number of customers at each node in a queueing network is the product of the individual probabilities times a multiplicative constant, as in Pr{N 1 = n 1, N 2 = n 2,..., N J = n J} = BÏ€ (n 1)Ï€ (n 2)...Ï€(n J), the network is said to have a product-form solution. Sometimes the designation of a product-form solution requires that the multiplicative constant also decompose into separate factors for each node, as it will in open Jackson networks. Variants of these sorts of solutions also occur in some non-network queues, such as those with vacations. Networks of queues; Queueing theory.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Product-form solution. In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_810
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_810
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive