Topological Design of Centralized Computer Networks

DOI10.1111/J.1475-3995.1997.TB00064.XMaRDI QIDQ4368605zbMATH OpenOpenAlexFDO

Authors Hasan Pirkul, Rakesh Gupta

Publication date 6 July 1998

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1475-3995.1997.tb00064.x

zbMATH Keywords

capacitated minimum spanning treecentralized computer-communication networksconcentrator locationLagrangian heuristictopological design

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• Topological design of computer communication networks -- the overall design problem
• INTEGER PROGRAMMING MODEL AND EXACT SOLUTION FOR CONCENTRATOR LOCATION PROBLEM
• An Algorithm for the Design of Multitype Concentrator Networks
• Efficient algorithms for the capacitated concentrator location problem
• Topological design of telecommunication networks --- local access design methods

Cites work

• A note on two problems in connexion with graphs
• Efficient algorithms for the capacitated concentrator location problem
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 710624 (Why is no real title available?)
• Large-Scale Network Topological Optimization
• Locating concentrators in centralized computer networks

Cited in

(12)

• The telephonic switching centre network problem: Formalization and computational experience
• Topological design of telecommunication networks --- local access design methods
• Dynamic programming based heuristics for the topological design of local access networks
• Topological design of computer communication networks -- the overall design problem
• Topological design of a centralized communication network with unreliable links and node outage costs
• Cost-optimal topology planning of hierarchical access networks
• Lower and upper bounds for a two-level hierarchical location problem in computer networks
• Location of Transfer Centres on Segments of a Communication Network with Proportional Traffic
• scientific article; zbMATH DE number 1163717 (Why is no real title available?)
• INTEGER PROGRAMMING MODEL AND EXACT SOLUTION FOR CONCENTRATOR LOCATION PROBLEM
• Optimization of resource location in hierarchical computer networks
• A mixed-integer approach to Core-Edge design of storage area networks

This page was built for publication: Topological Design of Centralized Computer Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4368605)