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

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 25
  • Download : 0
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.
Publisher
TAYLOR & FRANCIS LTD
Issue Date
2020-02
Language
English
Article Type
Article
Citation

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.71, no.2, pp.250 - 263

ISSN
0160-5682
DOI
10.1080/01605682.2018.1542959
URI
http://hdl.handle.net/10203/271604
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0