The Three-Criteria Servers Replication and Topology Assignment Problem in Wide Area Networks

DOI10.1007/11751595_117MaRDI QIDQ3600191zbMATH OpenOpenAlexFDO

Authors Marcin Markowski, A. Kasprzak

Publication date 10 February 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11751595_117

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Computational Science and Its Applications – ICCSA 2004
• The Gateways Location and Topology Assignment Problem in Hierarchical Wide Area Networks: Algorithms and Computational Results
• An Approximate Algorithm for the Minimal Cost Gateways Location, Capacity and Flow Assignment in Two-Level Hierarchical Wide Area Networks
• Exact and approximate algorithms for topological design of wide area networks with non-simultaneous single commodity flows
• Computational Science and Its Applications – ICCSA 2004

Cited in

(3)

• An Approximate Algorithm for the Minimal Cost Gateways Location, Capacity and Flow Assignment in Two-Level Hierarchical Wide Area Networks
• The Gateways Location and Topology Assignment Problem in Hierarchical Wide Area Networks: Algorithms and Computational Results
• Computational Science and Its Applications – ICCSA 2004

This page was built for publication: The Three-Criteria Servers Replication and Topology Assignment Problem in Wide Area Networks

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