An Approximate Algorithm for the Minimal Cost Gateways Location, Capacity and Flow Assignment in Two-Level Hierarchical Wide Area Networks

DOI10.1007/11758501_18zbMATH Open1155.68314OpenAlexW1599558143MaRDI QIDQ3545013FDOQ3545013

Przemyslaw Ryba, A. Kasprzak

Publication date: 9 December 2008

Published in: Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11758501_18

Recommendations

• The Gateways Location and Topology Assignment Problem in Hierarchical Wide Area Networks: Algorithms and Computational Results
• Computational Science and Its Applications – ICCSA 2004
• Exact and approximate algorithms for topological design of wide area networks with non-simultaneous single commodity flows
• scientific article; zbMATH DE number 1253063
• The Three-Criteria Servers Replication and Topology Assignment Problem in Wide Area Networks

Mathematics Subject Classification ID

Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Cited In (6)

• Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks
• A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks
• Computational Science and Its Applications – ICCSA 2004
• The Gateways Location and Topology Assignment Problem in Hierarchical Wide Area Networks: Algorithms and Computational Results
• A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access
• The Three-Criteria Servers Replication and Topology Assignment Problem in Wide Area Networks

This page was built for publication: An Approximate Algorithm for the Minimal Cost Gateways Location, Capacity and Flow Assignment in Two-Level Hierarchical Wide Area Networks

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