Abstract
The virtual path (VP) concept has been proposed to simplify traffic control and resource management in future B-ISDN. In particular, call setup processing can be significantly reduced when resources are reserved on VPs. However, this advantage is offset by a decrease in statistical multiplexing gains of the networks. The focus of this paper is on how to improve bandwidth efficiency through adaptive routing when capacity is reserved on all VPs. The authors first examine two VP capacity reservation strategies. They then design and evaluate computationally feasible Markov decision process-based routing algorithms and show that the network blocking probability can be significantly reduced by MDP routing. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
