IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v71y2020i2p250-263.html
   My bibliography  Save this article

A linear programming based heuristic algorithm for bandwidth packing problem with scheduling

Author

Listed:
  • Seulgi Joung
  • Jaeyoong Lim
  • Chungmok Lee
  • Jongyoon Shin
  • Ikkyun Jung
  • Sungsoo Park

Abstract

In this article, we consider a variant of the bandwidth packing problem, in which some demands need to be scheduled within given time windows. The emergence of cloud services has introduced a new challenge to the bandwidth packing problem. For example, a typical cloud service network consists of multiple data centres (DCs), and a huge amount of data must be exchanged between DCs to ensure the integrity of the data. This operation is not necessarily real-time, which allows network operators to schedule the demands over time. Motivated by a real-life network service provider in South Korea, we developed a practical heuristic algorithm for the problem. The algorithm utilises an open source linear programming solver. The performance of the proposed algorithm was assessed on the real-life telecommunication network in South Korea. The computational results showed that the proposed approach can provide near-optimal solutions within a short time.

Suggested Citation

  • Seulgi Joung & Jaeyoong Lim & Chungmok Lee & Jongyoon Shin & Ikkyun Jung & Sungsoo Park, 2020. "A linear programming based heuristic algorithm for bandwidth packing problem with scheduling," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 71(2), pages 250-263, February.
    • Handle: RePEc:taf:tjorxx:v:71:y:2020:i:2:p:250-263
    DOI: 10.1080/01605682.2018.1542959
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2018.1542959
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2018.1542959?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.

    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:taf:tjorxx:v:71:y:2020:i:2:p:250-263. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.