On a bi-dimensional dynamic alternative routing method
From MaRDI portal
Recommendations
Cites work
- A bicriterion shortest path algorithm
- An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
- Blocking probabilities in large circuit-switched networks
- Deviation algorithms for ranking shortest paths
- Dynamic Routing in Fully Connected Networks
- scientific article; zbMATH DE number 4215340 (Why is no real title available?)
- scientific article; zbMATH DE number 4106578 (Why is no real title available?)
- Routing and Capacity Allocation in Networks with Trunk Reservation
- Routing in circuit-switched networks: optimization, shadow prices and decentralization
Cited in
(12)- Balanced routing of random calls
- A new multiobjective dynamic routing method for multiservice networks: modelling and performance
- Fast heuristics for protection networks for dynamic routing
- Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: a heuristic solution
- Dynamic Routing in Fully Connected Networks
- scientific article; zbMATH DE number 3924478 (Why is no real title available?)
- On the behavioral aspects of alternate routing in non-hierarchical networks
- scientific article; zbMATH DE number 597623 (Why is no real title available?)
- Model of a frame of dynamic routing and its equilibrium
- Qualification routes messaging for dynamic systems using logical-probabilistic method
- Accuracy analysis of two CISCO network re-dimensioning methods
- On the enrouting protocol problem under uncertainty
This page was built for publication: On a bi-dimensional dynamic alternative routing method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q555940)
