Dynamic Routing in Broadband Networks focuses on routing in broadband networks based on MPLS (Multiprotocol Label Switching) and ATM (Asynchronous Transfer Mode). The routing methods are based on the theory of Markov decision processes which forms a very accurate framework for on-line route optimization. The author shows the issue of performance optimization and scalability with respect to dynamic routing of logical connections in broadband networks. The methods used are applicable to routing virtual path connections (VPC) and virtual channel connections (VCC) in ATM networks as well as label switched paths (LSP) in MPLS networks. Simulation results and a performance comparison with reference routing are given for the different schemes.Two algorithms can be employed: the Virtual Scheduling Algorithm (VSA) or the Continuous-State Leaky Bucket ... Both algorithms, the VSA and the CSLBA are illustrated in Figure 3-3. ... Figure 3-3: Flow diagrams of the UPC Function .
|Title||:||Dynamic Routing in Broadband Networks|
|Publisher||:||Springer Science & Business Media - 2012-12-06|