Optimal hop-by-hop flow control in computer networks

The problem of hop-by-hop flow control in a computer network is formulated as a Markov decision process with a cost function composed of the delay of the messages and the buffer constraints. The optimal control is shown to be a linear truncated function of the state and the explicit form is found wh...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on automatic control Vol. 31; no. 9; pp. 813 - 822
Main Authors Rosberg, Z., Gopal, I.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.09.1986
Institute of Electrical and Electronics Engineers
Subjects
Applied sciences
Buffer storage
Computer networks
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Control systems
Delay
Distribution functions
Exact sciences and technology
Optimal control
Size control
Software
Telecommunication traffic
Transmitters
Overflow(computer arithmetics)
Markov process
Computer network
Overload
Storage management
Optimal control
Transmitter
Receiver
Online AccessGet full text

Cover

More Information
Summary:The problem of hop-by-hop flow control in a computer network is formulated as a Markov decision process with a cost function composed of the delay of the messages and the buffer constraints. The optimal control is shown to be a linear truncated function of the state and the explicit form is found when the arrival process of the messages is a Bernoulli process. For a renewal arrival process, the long-rnn average cost of any policy with a linear truncated structure is expressed by a set of linear equations.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.1986.1104413