Load Shared Sequential Routing in MPLS Networks: System and User Optimal Solutions

DOI10.1007/978-3-540-72709-5_24MaRDI QIDQ3614988zbMATH OpenOpenAlexFDO

Authors Gilles Brunet, Fariba Heidari, Lorne G. Mason

Publication date 17 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72709-5_24

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Sequencial Routing Optimization for Circuit Switched Networks
• On the solution of reroute sequence planning problem in MPLS networks.
• scientific article; zbMATH DE number 2088593
• Prompt partial path optimization in MPLS networks
• scientific article; zbMATH DE number 2090777
• scientific article; zbMATH DE number 2088500
• An efficient algorithm for global path optimization in MPLS networks

Cites work

• A Minimum Delay Routing Algorithm Using Distributed Computation
• An optimal learning algorithm for S-model environments
• Decentralized Adaptive Flow Control of High-Speed Connectionless Data Networks
• Dynamic Cesaro-Wardrop equilibration in networks
• Effective bandwidths at multi-class queues
• scientific article; zbMATH DE number 3982887 (Why is no real title available?)

Cited in

(2)

• scientific article; zbMATH DE number 2088500 (Why is no real title available?)
• scientific article; zbMATH DE number 2090777 (Why is no real title available?)

This page was built for publication: Load Shared Sequential Routing in MPLS Networks: System and User Optimal Solutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3614988)