Optimal Hop-by-Hop Flow Control in Computer Networks

Zvi Rosberg, Inder S. Gopal

Research output: Contribution to journalConference articlepeer-review


The problem of the 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 have a linear truncated structure and the explicit form is found when the arrival process of the messages is a Bernoulli process. For a renewal arrival process, the long-run average cost of any policy with a linear truncated structure is expressed by a set of linear equations.

Original languageEnglish
Pages (from-to)688-692
Number of pages5
JournalProceedings - Annual Allerton Conference on Communication, Control, and Computing
StatePublished - 1 Dec 1985
Externally publishedYes


Dive into the research topics of 'Optimal Hop-by-Hop Flow Control in Computer Networks'. Together they form a unique fingerprint.

Cite this