IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-42902-1_15.html
   My bibliography  Save this book chapter

A Benders Decomposition Approach for Static Data Segment Location to Servers Connected by a Tree Backbone

In: Operations Research Proceedings 2015

Author

Listed:
  • Goutam Sen

    (IIT Bombay)

  • Mohan Krishnamoorthy

    (Monash University)

  • Vishnu Narayanan

    (IIT Bombay)

  • Narayan Rangaraj

    (IIT Bombay)

Abstract

We consider the problem of allocating database segments to the locations of a content distribution network (CDN). Many other decisions such as server location, query routing, user assignment and network topology are also addressed simultaneously. We consider the problem with the backbone (server network) being restricted to be a tree. Although it is an extremely hard problem to solve in its original form, prior information on the segment allocation, server location, and the tree backbone, reduces the original problem to a simple assignment problem, and therefore, indicates the suitability of a decomposition approach. We formulate the problem and develop a Benders decomposition approach. Due to the hardness of the master problem, we solve it heuristically to obtain a reasonable upper bound on the original problem in a short period of time. The success of the algorithm is particularly significant in large problems, for which CPLEX struggles to obtain even a feasible integer solution.

Suggested Citation

  • Goutam Sen & Mohan Krishnamoorthy & Vishnu Narayanan & Narayan Rangaraj, 2017. "A Benders Decomposition Approach for Static Data Segment Location to Servers Connected by a Tree Backbone," Operations Research Proceedings, in: Karl Franz Dörner & Ivana Ljubic & Georg Pflug & Gernot Tragler (ed.), Operations Research Proceedings 2015, pages 109-116, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-42902-1_15
    DOI: 10.1007/978-3-319-42902-1_15
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    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:spr:oprchp:978-3-319-42902-1_15. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.