|
Abstract : |
The Virtual Path (VP) concept has been proposed to simplify traffic control and resource management in future B-ISDN. An advantage of this concept is that call setup processing can be significantly reduced when resources are reserved on VP's. However, this advantage can be offset by the decrease in the statistical multiplexing gains of networks supporting VP's. The focus of this paper is on how to improve bandwidth efficiency through adaptive routing when capacity is reserved on VP's. We first examine two VP capacity reservation strategies. We then design and evaluate computationally feasible Markov decision process-based routing algorithms and show that the network call blocking probability can be significantly reduced by MDP routing. 1, |
