Backbone Network Design Tools with Economic Tradeoffs

DOI10.1287/IJOC.2.3.236zbMATH Open0755.90024OpenAlexW2090532016MaRDI QIDQ4025918FDOQ4025918

Authors: Bezalel Gavish, Kemal Altinkemer 

Publication date: 18 February 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2.3.236

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

zbMATH Keywords

lower boundssubgradient optimizationLagrangian relaxationheuristic methodbackbone networkrouting and link capacities

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Communication networks in operations research (90B18)

Cited In (33)

• Diversification strategies in local search for a nonbifurcated network loading problem
• Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs
• Asynchronous transfer mode networks with parallel links and multiple service classes
• Title not available (Why is that?)
• Primary and secondary route selection in backbone communication networks
• Fast, efficient equipment placement heuristics for broadband switched or internet router net\-works
• Capacity planning in manufacturing and computer networks
• Topological design of computer communication networks -- the overall design problem
• A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs.
• Bidirected and unidirected capacity installation in telecommunication networks.
• A tabu search algorithm for the routing and capacity assignment problem in computer networks
• Some approaches to solving a multihour broadband network capacity design problem with single-path routing
• A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem
• New formulations and solution procedures for the hop constrained network design problem.
• Separable convexification and DCA techniques for capacity and flow assignment problems.
• Routing and capacity assignment in backbone communication networks
• Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
• An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
• Class Dependent Routing In Backbone Computer Networks
• Algorithms for the non-bifurcated network design problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dimensioning multicast-enabled communications networks
• Resource allocation and capacity assignment in distributed systems
• Topological design of wide area communication networks
• A branch and price approach for the robust bandwidth packing problem with queuing delays
• The network redesign problem for access telecommunications networks
• Configuring wide area computer networks. Problems and models
• 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
• Algorithms for an integer multicommodity network flow problem with node reliability considerations
• Exact approaches to the single-source network loading problem

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)