By Topic

Performance potentials based stochastic optimization and parallel algorithm for a class of CQN

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)
Xiaobin Tan ; Dept. of Autom., Univ. of Sci. & Technol. of China, Hefei, China ; Hongsheng Xi ; Baoqun Yin

We provide new derivative formulas of the steady-state performance cost for a class of CPN (Closed Queuing Network) defined on an admissible policy set. Three fundamental quantities, performance potentials, realization factors and group inverse of the infinitesimal generator involved in the derivative formulas are given. Some simulation-based algorithms are used to estimate these performance potentials by analyzing a single sample path of CQN, and the two main methods, parallel matrix computation and CRN, are introduced to calculate these quantities. The algorithm of the optimal service policy to minimize the performance cost is obtained by using a parallel stochastic optimization method driven by a performance potential-based gradient estimate.

Published in:

High Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition on  (Volume:2 )

Date of Conference:

14-17 May 2000