Approximation algorithm for optimal location of concentrators and design of capacitated survivable backbone networks (Q622809)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation algorithm for optimal location of concentrators and design of capacitated survivable backbone networks |
scientific article; zbMATH DE number 5845422
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithm for optimal location of concentrators and design of capacitated survivable backbone networks |
scientific article; zbMATH DE number 5845422 |
Statements
Approximation algorithm for optimal location of concentrators and design of capacitated survivable backbone networks (English)
0 references
4 February 2011
0 references
Summary: We focus on the problem of selecting concentrator locations to minimise the access network costs. This falls under the general class of Uncapacitated Facility Location (UFL) problem. We present an approximation algorithm along with some computational results. We also study the problem of designing a Capacitated Survivable Backbone Network (CSBN) with the property that there is at least one route present between all the communicating node pairs in the case of a single link failure. Mathematical formulation to efficiently solve the survivable backbone network design problem is presented. The methodologies developed are applied to a real world setting obtaining optimal or near-optimal results.
0 references
facility location
0 references
access networks
0 references
survivable backbone networks
0 references
capacitated backbone networks
0 references
\(k\)-connected networks
0 references
concentrator locations
0 references
network costs
0 references
link failure
0 references
network design
0 references