Optimal hop-by-hop flow control in computer networks
I Gopal - IEEE transactions on automatic control, 1986 - ieeexplore.ieee.org
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 …
decision process with a cost function composed of the delay of the messages and the buffer …
Optimal Hop-by-Hop Flow Control in Computer Networks
Z Rosberg, IS Gopal - Proceedings-Annual Allerton Conference on …, 1985 - cris.bgu.ac.il
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 …
decision process with a cost function composed of the delay of the messages and the buffer …
[引用][C] Optimal hop-by-hop flow control in computer networks
Z ROSBERG, IS GOPAL - IEEE transactions on automatic …, 1986 - pascal-francis.inist.fr
Optimal hop-by-hop flow control in computer networks CNRS Inist Pascal-Francis CNRS
Pascal and Francis Bibliographic Databases Simple search Advanced search Search by …
Pascal and Francis Bibliographic Databases Simple search Advanced search Search by …
Optimal Hop-by-Hop Flow Control in Computer Networks
Z Rosberg, IS Gopal - IEEE TACON, 1986 - research.ibm.com
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 …
decision process with a cost function composed of the delay of the messages and the buffer …
Optimal Hop-by-Hop Flow Control in Computer Networks
Z Rosberg, IS Gopal - IEEE Transactions on Automatic Control, 1986 - cris.bgu.ac.il
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 …
decision process with a cost function composed of the delay of the messages and the buffer …