How far are we from steady state? On-line error bounds for steady state approximations

How far are we from steady state? On-line error bounds for steady state approximations
Original hosted in "OpenScout", contributed by Social Updater on 19/01/2015
By studying performance measures via reward structures, on-line error bounds are obtained by successive approximation. These bounds enable one to determine when to terminate computation with a guaranteed accuracy. Furthermore, they provide insight into steady-state convergence in practical situations. the method is tested for a number of simple capacitated queuing networks. The results obtained indicate that the method provides a practical tool for numerically approximating performance measures of queuing networks
Rating: -/5
Views: 1282
Resource type: Educational Object
Languages:
Target age group: 18+
Copyright: Yes
Cost: Use is free of charge

Comments

There are no Comments yet. Be the first to Post a Comment

In order to be able to post a comment you have to be logged in to the portal. You can login or register a new account by pressing the "Login" button at the top right corner.