Optimal flow control allocation policies in communication networks with multiple message classes

Author

Bournas, Redha M. ; Beutler, Frederick J. ; Teneketzis, Demosthenis

Author_Institution

IBM Networking Systems, Research Triangle Park, NC, USA

Volume

38

Issue

3

fYear

1993

fDate

3/1/1993 12:00:00 AM

Firstpage

390

Lastpage

403

Abstract

Flow control is considered for M(⩾2) transmitting stations sending packets to a single receiver over a slotted time-multiplexed link. The optimal allocation problem is generalized to the case of nonidentical holding costs at the M transmitters. Qualitative properties of optimal discounted and time-average policies that reduce the computational complexity of the M-dimensional optimal flow control algorithm are derived. For M=2, a simple relationship between optimal allocations for states x and x +e_i (i=1,2) that leads to significant computational savings in the optimal algorithm is established

Keywords

Markov processes; decision theory; message switching; optimisation; packet switching; queueing theory; Markov decision processes; communication networks; computational complexity; discounted policies; message switching; multiple message classes; optimal flow control allocation policies; optimisation; packet switching; queueing theory; slotted time-multiplexed link; time-average policies; Character generation; Communication networks; Communication system control; Computational complexity; Computer networks; Cost function; Delay; Intelligent networks; Optimal control; Transmitters;

fLanguage

English

Journal_Title

Automatic Control, IEEE Transactions on

Publisher

ieee

ISSN

0018-9286

Type

jour

DOI

10.1109/9.210138

Filename

210138