System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Geometric Bounds: A Noniterative Analysis Technique for Closed Queueing Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Casale, G. ; Dept. of Comput. Sci., Coll. of William & Mary, Williamsburg, VA ; Muntz, Richard R. ; Serazzi, G.

We propose the Geometric Bounds (GBs), a new family of fast and accurate noniterative bounds on closed queueing network performance metrics that can be used in the online optimization of distributed applications. Compared to state-of-the-art techniques such as the Balanced Job Bounds (BJBs), GB achieves higher accuracy at similar computational costs, limiting the worst- case bounding error typically within 5-13 percent when, for the BJB, it is usually in the range of 15-35 percent. Optimization problems that are solved with GBs return solutions that are much closer to the global optimum than with existing bounds. We also show that the GB technique generalizes as an accurate approximation to closed fork-join networks commonly used in disk, parallel, and database models, thus extending the applicability of the method beyond the optimization of basic product-form networks.

Published in:

Computers, IEEE Transactions on  (Volume:57 ,  Issue: 6 )