By Topic

Properties of optimal hop-by-hop allocation policies in networks with multiple transmitters and linear equal holding costs

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

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)
Bournas, R.M. ; Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA ; Beutler, F.J. ; Teneketzis, D.

Flow control between one receiving node and its adjacent transmitting nodes in a computer network is modeled as a Markov decision problem. By deriving several qualitative properties of an optimal allocation policy, it is shown that finding dynamic optimal allocations for only T states suffices to completely describe an optimal allocation policy. When the number of transmitters M=2, for all but one of the T states there are only two allocations that are candidates for optimality. It is desirable to extend this property to M>2. However, it appears that the technique used for M =2 does not generalize to M>2

Published in:

Automatic Control, IEEE Transactions on  (Volume:36 ,  Issue: 12 )