IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v3y2011i1p22-43.html
   My bibliography  Save this article

Approximation algorithm for optimal location of concentrators and design of Capacitated Survivable Backbone Networks

Author

Listed:
  • Arun Jotshi
  • Sarat Puthenpura
  • Wenjie Zhao

Abstract

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.

Suggested Citation

  • Arun Jotshi & Sarat Puthenpura & Wenjie Zhao, 2011. "Approximation algorithm for optimal location of concentrators and design of Capacitated Survivable Backbone Networks," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 3(1), pages 22-43.
    • Handle: RePEc:ids:ijmore:v:3:y:2011:i:1:p:22-43
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=37311
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijmore:v:3:y:2011:i:1:p:22-43. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.