Optimal admission and routing at a simple data network node
Summary form only given, as follows. A stream of messages reaches the buffer of a node in a communication network, according to a Poisson distribution with parameter λ. The messages are then to be routed over two channels with different propagation times that are exponentially distributed with parameters μ1 and μ2, where μ1 is larger than μ2. Two controls are to be applied at the node. The first control concerns the admission of a message into the buffer, and the second control is responsible for routing the buffered messages over the two channels. The author determines the optimal policy which minimizes an expected cost involving the weighted sum of a penalty for not admitting a message into the buffer and a penalty for the delay experienced by the messages already stored in the buffer.
|Conference||1990 IEEE International Symposium on Information Theory|
Lambadaris, I. (1990). Optimal admission and routing at a simple data network node. In 1990 IEEE International Symposium on Information Theory.