IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v59y2008i11d10.1057_palgrave.jors.2602490.html
   My bibliography  Save this article

A two-level simulated annealing algorithm for efficient dissemination of electronic content

Author

Listed:
  • T Bektaş

    (Center for Research on Transportation, HEC Montréal
    University of Alberta)

  • J-F Cordeau

    (Center for Research on Transportation, HEC Montréal)

  • E Erkut

    (University of Alberta)

  • G Laporte

    (Center for Research on Transportation, HEC Montréal)

Abstract

This paper describes a two-level simulated annealing heuristic for the joint problem of object placement and request routing in a Content Distribution Network (CDN) with constraints pertaining to server capacity and end-to-end object transfer delay. A CDN is a technology that is used to efficiently distribute electronic content throughout an existing network. The two-level solution procedure is composed of an outer and an inner simulated annealing algorithms. Computational experiments are conducted by comparing the proposed procedure with several truncated exact solution algorithms on randomly generated Internet topologies.

Suggested Citation

  • T Bektaş & J-F Cordeau & E Erkut & G Laporte, 2008. "A two-level simulated annealing algorithm for efficient dissemination of electronic content," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1557-1567, November.
    • Handle: RePEc:pal:jorsoc:v:59:y:2008:i:11:d:10.1057_palgrave.jors.2602490
    DOI: 10.1057/palgrave.jors.2602490
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602490
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602490?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    References listed on IDEAS

    as
    1. Pirkul, Hasan, 1986. "An integer programming model for the allocation of databases in a distributed computer system," European Journal of Operational Research, Elsevier, vol. 26(3), pages 401-411, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yiting Xing & Ling Li & Zhuming Bi & Marzena Wilamowska‐Korsak & Li Zhang, 2013. "Operations Research (OR) in Service Industries: A Comprehensive Review," Systems Research and Behavioral Science, Wiley Blackwell, vol. 30(3), pages 300-353, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Goutam Sen & Mohan Krishnamoorthy & Narayan Rangaraj & Vishnu Narayanan, 2016. "Facility location models to locate data in information networks: a literature review," Annals of Operations Research, Springer, vol. 246(1), pages 313-348, November.
    2. Basu, Amit, 1998. "Perspectives on operations research in data and knowledge management," European Journal of Operational Research, Elsevier, vol. 111(1), pages 1-14, November.
    3. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    4. LeBlanc, Larry J. & Shtub, Avraham & Anandalingam, G., 1999. "Formulating and solving production planning problems," European Journal of Operational Research, Elsevier, vol. 112(1), pages 54-80, January.
    5. Maciej Drwal & Jerzy Jozefczyk, 2014. "Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding," Annals of Operations Research, Springer, vol. 222(1), pages 261-277, November.
    6. Klose, Andreas & Drexl, Andreas, 2001. "Combinatorial optimisation problems of the assignment type and a partitioning approach," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 545, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    7. Özlem Karsu & Meral Azizoğlu, 2014. "Bicriteria multiresource generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(8), pages 621-636, December.
    8. Joseph B. Mazzola & Steven P. Wilcox, 2001. "Heuristics for the multi‐resource generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(6), pages 468-483, September.
    9. R. Ramesh & B. Ryan, 1990. "Optimal file allocation and report assignment in distributed information networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(1), pages 165-181, February.

    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:pal:jorsoc:v:59:y:2008:i:11:d:10.1057_palgrave.jors.2602490. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.palgrave-journals.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.