Routing and capacity assignment in backbone communication networks
From MaRDI portal
(Redirected from Publication:1373886)
Recommendations
- Routing and capacity assignment in backbone communication networks under time varying traffic conditions
- Backbone Network Design Tools with Economic Tradeoffs
- scientific article; zbMATH DE number 484567
- scientific article; zbMATH DE number 4149863
- On the capacity assignment problem in packet-switching computer networks
Cites work
- scientific article; zbMATH DE number 3918092 (Why is no real title available?)
- scientific article; zbMATH DE number 3501014 (Why is no real title available?)
- scientific article; zbMATH DE number 3562235 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network
- A dual ascent approach for steiner tree problems on a directed graph
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- An algorithm for the optimization of nonbifurcated flows in computer communication networks
- Backbone Network Design Tools with Economic Tradeoffs
- Continuous Models for Capacity Design of Large Packet-Switched Telecommunication Networks
- Heuristic Design Algorithm for Computer Communication Networks with Different Classes of Packets
- On the selection of primary paths for a communication network
- Primary and Secondary Route Selection in Backbone Computer Networks
- Routing in computer networks
- The auction algorithm: A distributed relaxation method for the assignment problem
- The flow deviation method: An approach to store‐and‐forward communication network design
- Validation of subgradient optimization
Cited in
(21)- Optimal double-resource assignment for the robust design problem in multistate computer networks
- Network reliability maximization for stochastic-flow network subject to correlated failures using genetic algorithm and tabu search
- Solution of a certain class of network flow problems with cascaded demand aggregation and capacity allocation
- Robust capacity assignment in telecommunications
- Asynchronous transfer mode networks with parallel links and multiple service classes
- Load balancing optimization of capacitated networks with path protection
- Developing concurrent investment plans for power generation and transmission
- Backbone Network Design Tools with Economic Tradeoffs
- A tabu search algorithm for the routing and capacity assignment problem in computer networks
- Optimal resource assignment to maximize multistate network reliability for a computer network
- scientific article; zbMATH DE number 4139463 (Why is no real title available?)
- scientific article; zbMATH DE number 484567 (Why is no real title available?)
- scientific article; zbMATH DE number 4033461 (Why is no real title available?)
- Multi-objective optimization for stochastic computer networks using NSGA-II and TOPSIS
- Stochastic computer network under accuracy rate constraint from QoS viewpoint
- scientific article; zbMATH DE number 1743829 (Why is no real title available?)
- Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget
- Component allocation cost minimization for a multistate computer network subject to a reliability threshold using tabu search
- Routing and capacity assignment in backbone communication networks under time varying traffic conditions
- A system for priority routing and capacity assignment in packet switched networks
- An efficient heuristic to dimension large-scale hybrid optoelectronic networks
This page was built for publication: Routing and capacity assignment in backbone communication networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373886)
