Routing and capacity assignment in backbone communication networks
From MaRDI portal
Publication:1373886
DOI10.1016/S0305-0548(96)00049-4zbMATH Open0889.90066OpenAlexW2085923138MaRDI QIDQ1373886FDOQ1373886
Authors: Ali Amiri, Hasan Pirkul 
Publication date: 25 November 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(96)00049-4
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
- The auction algorithm: A distributed relaxation method for the assignment problem
- Title not available (Why is that?)
- Validation of subgradient optimization
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- Title not available (Why is that?)
- A dual ascent approach for steiner tree problems on a directed graph
- Backbone Network Design Tools with Economic Tradeoffs
- The flow deviation method: An approach to store‐and‐forward communication network design
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- Routing in computer networks
- Title not available (Why is that?)
- Primary and Secondary Route Selection in Backbone Computer Networks
- A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network
- An algorithm for the optimization of nonbifurcated flows in computer communication networks
- 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
- Title not available (Why is that?)
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
- Backbone Network Design Tools with Economic Tradeoffs
- Developing concurrent investment plans for power generation and transmission
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multi-objective optimization for stochastic computer networks using NSGA-II and TOPSIS
- Stochastic computer network under accuracy rate constraint from QoS viewpoint
- Title not available (Why is that?)
- 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
- An efficient heuristic to dimension large-scale hybrid optoelectronic networks
- 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
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)
