Optimal Hop-By-Hop Flow Control Policies in Computer Networks with Multiple Transmitters : Convexity and Monotonicity Properties Part I : Linear and Equal Holding Costs

@inproceedings{Bournas1990OptimalHF,
  title={Optimal Hop-By-Hop Flow Control Policies in Computer Networks with Multiple Transmitters : Convexity and Monotonicity Properties Part I : Linear and Equal Holding Costs},
  author={Redha M. Bournas and Frederick J. Beutler},
  year={1990}
}
We model ow control between one receiving node and its adjacent transmitting nodes in a computer network as a Markov decision problem. Given that the control action is to dynamically allocate a xed number of time slots amongM 2 transmitters, the objective is to characterize policies that minimize the total number of messages awaiting service at the… CONTINUE READING