By Topic

Optimal flow control of multiclass queueing networks with partial information

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
$33 $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

2 Author(s)
Hsiao, M.-T.T. ; Sch. of Electr. Eng., Purdue Univ., West Lafayette, IN, USA ; Lazar, A.A.

Structural results and explicit solutions for the optimal flow control problem of multiclass queueing networks with decentralized information are given. Two criteria are investigated: the network (respectively, user) optimization criterion maximizes the average network (user) throughput subject to an average network (user) time delay constraint. It is shown that these problems can be analyzed in terms of an equivalent network by using the generalized Norton's equivalent. The structure of the network (user) optimization problem is exploited to obtain further structural results, namely a representation (separation) theorem. The optimal flow control under both criteria is solved using a linear programming formulation. The structure of the optimal control is shown to be of a window type in both cases. For load-balanced networks, the optimal flow control is found explicitly in terms of the given system parameters

Published in:

Automatic Control, IEEE Transactions on  (Volume:35 ,  Issue: 7 )