Optimal Hop-by-Hop Flow Control in Computer Networks

Zvi Rosberg; Inder S. Gopal

doi:10.1109/TAC.1986.1104413

Optimal Hop-by-Hop Flow Control in Computer Networks

Zvi Rosberg, Inder S. Gopal

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Abstract

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-run average cost of any policy with a linear truncated structure is expressed by a set of linear equations.

Original language	English
Pages (from-to)	813-822
Number of pages	10
Journal	IEEE Transactions on Automatic Control
Volume	31
Issue number	9
DOIs	https://doi.org/10.1109/TAC.1986.1104413
State	Published - 1 Jan 1986
Externally published	Yes

ASJC Scopus subject areas

Control and Systems Engineering
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/TAC.1986.1104413

Cite this

@article{3244a5002c814b4fab6e199fbfcf64ab,

title = "Optimal Hop-by-Hop Flow Control in Computer Networks",

abstract = "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-run average cost of any policy with a linear truncated structure is expressed by a set of linear equations.",

author = "Zvi Rosberg and Gopal, \{Inder S.\}",

year = "1986",

month = jan,

day = "1",

doi = "10.1109/TAC.1986.1104413",

language = "English",

volume = "31",

pages = "813--822",

journal = "IEEE Transactions on Automatic Control",

issn = "0018-9286",

publisher = "Institute of Electrical and Electronics Engineers",

number = "9",

}

TY - JOUR

T1 - Optimal Hop-by-Hop Flow Control in Computer Networks

AU - Rosberg, Zvi

AU - Gopal, Inder S.

PY - 1986/1/1

Y1 - 1986/1/1

N2 - 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-run average cost of any policy with a linear truncated structure is expressed by a set of linear equations.

AB - 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-run average cost of any policy with a linear truncated structure is expressed by a set of linear equations.

UR - http://www.scopus.com/inward/record.url?scp=0022787688&partnerID=8YFLogxK

U2 - 10.1109/TAC.1986.1104413

DO - 10.1109/TAC.1986.1104413

M3 - Article

AN - SCOPUS:0022787688

SN - 0018-9286

VL - 31

SP - 813

EP - 822

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

IS - 9

ER -

Optimal Hop-by-Hop Flow Control in Computer Networks

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this