Backbone Network Design Tools with Economic Tradeoffs
From MaRDI portal
Recommendations
- Routing and capacity assignment in backbone communication networks
- Routing and capacity assignment in backbone communication networks under time varying traffic conditions
- scientific article; zbMATH DE number 1717234
- Topological design of computer communication networks -- the overall design problem
- Class Dependent Routing In Backbone Computer Networks
Cited in
(35)- A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem
- Topological design of computer communication networks -- the overall design problem
- A system for priority routing and capacity assignment in packet switched networks
- Topological design of wide area communication networks
- Configuring wide area computer networks. Problems and models
- Primary and secondary route selection in backbone communication networks
- Capacity planning in manufacturing and computer networks
- Routing and capacity assignment in backbone communication networks
- Bidirected and unidirected capacity installation in telecommunication networks.
- A tabu search algorithm for the routing and capacity assignment problem in computer networks
- New formulations and solution procedures for the hop constrained network design problem.
- Routing and capacity assignment in backbone communication networks under time varying traffic conditions
- Diversification strategies in local search for a nonbifurcated network loading problem
- Some approaches to solving a multihour broadband network capacity design problem with single-path routing
- Asynchronous transfer mode networks with parallel links and multiple service classes
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
- A branch and price approach for the robust bandwidth packing problem with queuing delays
- Algorithms for an integer multicommodity network flow problem with node reliability considerations
- Algorithms for the non-bifurcated network design problem
- A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs.
- Resource allocation and capacity assignment in distributed systems
- An efficient heuristic to dimension large-scale hybrid optoelectronic networks
- Separable convexification and DCA techniques for capacity and flow assignment problems.
- scientific article; zbMATH DE number 1717234 (Why is no real title available?)
- Exact approaches to the single-source network loading problem
- Dimensioning multicast-enabled communications networks
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
- The network redesign problem for access telecommunications networks
- Primary and Secondary Route Selection in Backbone Computer Networks
- scientific article; zbMATH DE number 1990728 (Why is no real title available?)
- scientific article; zbMATH DE number 1743829 (Why is no real title available?)
- Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs
- Fast, efficient equipment placement heuristics for broadband switched or internet router net\-works
- Class Dependent Routing In Backbone Computer Networks
- Strengthening dual bounds for multicommodity capacitated network design with unsplittable flow constraints
This page was built for publication: Backbone Network Design Tools with Economic Tradeoffs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4025918)
