Abstract
We extend linear programming performance evaluation methods to closed reentrant queueing networks. The approach automatically generates the parameters for a surrogate of the differential cost function and enables us to obtain bounds on the system throughput at reduced computational cost than exact solution methodologies. A comparison study of the bounds with the actual performance for tractable examples is conducted. The results show that the bounds can be quite good, in particular for unbalanced networks. For the closed version of a well known unstable network, we investigate the performance of the bounds and explore the asymptotic loss of the system.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
