Topological design of computer communication networks -- the overall design problem

DOI10.1016/0377-2217(92)90204-MzbMath0792.68005OpenAlexW2078570028MaRDI QIDQ1194726

Bezalel Gavish

Publication date: 6 October 1992

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90204-m

zbMATH Keywords

combinatorial optimizationLagrangean relaxationcomputer communication networkstopological designnetwork control processors

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Network design and communication in computer systems (68M10) Combinatorial optimization (90C27)

Related Items (18)

Cost-optimal topology planning of hierarchical access networks ⋮ Optimal infrastructure design and expansion of broadband wireless access networks ⋮ A mixed-integer approach to Core-Edge design of storage area networks ⋮ Some thoughts on combinatorial optimisation ⋮ Physical network design to facilitate capacity reallocation ⋮ Topological design of telecommunication networks --- local access design methods ⋮ Lower and upper bounds for a two-level hierarchical location problem in computer networks ⋮ Topological design of wide area communication networks ⋮ Configuring wide area computer networks. Problems and models ⋮ Two-level evolutionary approach to the survivable mesh-based transport network topological design ⋮ Capacity planning with congestion effects ⋮ Optimal locations of switches and interconnections for ATM LANs ⋮ VNS and second order heuristics for the min-degree constrained minimum spanning tree problem ⋮ Hybrid fiber co-axial CATV network design with variable capacity optical network units ⋮ Benders-and-cut algorithm for fixed-charge capacitated network design problem ⋮ A dynamic programming algorithm for the local access telecommunication network expansion problem ⋮ Algorithms for a multi-level network optimization problem ⋮ A tabu search algorithm for the optimisation of telecommunication networks

Cites Work

• Unnamed Item
• Unnamed Item
• Topological design of telecommunication networks --- local access design methods
• The auction algorithm: A distributed relaxation method for the assignment problem
• Heuristics with Constant Error Guarantees for the Design of Tree Networks
• An algorithm for the optimization of nonbifurcated flows in computer communication networks
• Topological design of centralized computer networks—formulations and algorithms
• Backbone Network Design Tools with Economic Tradeoffs
• Discrete Link Capacity and Priority Assignments in Communication Networks
• Heuristic Design Algorithm for Computer Communication Networks with Different Classes of Packets
• Large-Scale Network Topological Optimization
• The flow deviation method: An approach to store‐and‐forward communication network design
• A delay dependent queue discipline
• The traveling-salesman problem and minimum spanning trees: Part II

This page was built for publication: Topological design of computer communication networks -- the overall design problem