Telecommunications network design: Technology impacts and future directions
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5831321
- scientific article; zbMATH DE number 5173825
- The role of stochastic programming in communication network design
- Telecommunication network capacity design for uncertain demand
- Topological design of telecommunication networks --- local access design methods
Cites work
- A Minimum Delay Routing Algorithm Using Distributed Computation
- An improved Benders decomposition applied to a multi-layer network design problem
- Efficient techniques and tools for intra-domain traffic engineering
- Hardness of robust network design
- How bad is selfish routing?
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 1535630 (Why is no real title available?)
- scientific article; zbMATH DE number 2150800 (Why is no real title available?)
- scientific article; zbMATH DE number 795223 (Why is no real title available?)
- Increasing internet capacity using local search
- Low earth orbit satellite based communication systems -- research opportunities
- Models for planning capacity expansion in local access telecommunication networks
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
- Origin-Based Algorithm for the Traffic Assignment Problem
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks
- Solving a minimum-power covering problem with overlap constraint for cellular network design
- Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing
- Strong formulations for network design problems with connectivity requirements
- Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
- The flow deviation method: An approach to store‐and‐forward communication network design
- The mathematics of internet congestion control
- The recoverable robust two-level network design problem
- The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
- Topological design of survivable mesh-based transport networks
- Towards optimizing the deployment of optical access networks
- Twenty lectures on algorithmic game theory
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
Cited in
(8)- scientific article; zbMATH DE number 1006334 (Why is no real title available?)
- scientific article; zbMATH DE number 5173825 (Why is no real title available?)
- scientific article; zbMATH DE number 5173827 (Why is no real title available?)
- Telecommunications network case study: selecting a data network architecture
- Capacity-preserving subgraphs of directed flow networks
- Network design with vulnerability constraints and probabilistic edge reliability
- Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms
- Strengthening dual bounds for multicommodity capacitated network design with unsplittable flow constraints
This page was built for publication: Telecommunications network design: Technology impacts and future directions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087074)
