DC Field | Value | Language |
---|---|---|
dc.contributor.author | Joung, Seulgi | ko |
dc.contributor.author | Lim, Jaeyoong | ko |
dc.contributor.author | Lee, Chungmok | ko |
dc.contributor.author | Shin, Jongyoon | ko |
dc.contributor.author | Jung, Ikkyun | ko |
dc.contributor.author | Park, Sungsoo | ko |
dc.date.accessioned | 2020-01-21T01:20:05Z | - |
dc.date.available | 2020-01-21T01:20:05Z | - |
dc.date.created | 2020-01-13 | - |
dc.date.issued | 2020-02 | - |
dc.identifier.citation | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.71, no.2, pp.250 - 263 | - |
dc.identifier.issn | 0160-5682 | - |
dc.identifier.uri | http://hdl.handle.net/10203/271604 | - |
dc.description.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. | - |
dc.language | English | - |
dc.publisher | TAYLOR & FRANCIS LTD | - |
dc.title | A linear programming based heuristic algorithm for bandwidth packing problem with scheduling | - |
dc.type | Article | - |
dc.identifier.wosid | 000506465800006 | - |
dc.identifier.scopusid | 2-s2.0-85061831178 | - |
dc.type.rims | ART | - |
dc.citation.volume | 71 | - |
dc.citation.issue | 2 | - |
dc.citation.beginningpage | 250 | - |
dc.citation.endingpage | 263 | - |
dc.citation.publicationname | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | - |
dc.identifier.doi | 10.1080/01605682.2018.1542959 | - |
dc.contributor.localauthor | Park, Sungsoo | - |
dc.contributor.nonIdAuthor | Lee, Chungmok | - |
dc.contributor.nonIdAuthor | Shin, Jongyoon | - |
dc.contributor.nonIdAuthor | Jung, Ikkyun | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Bandwidth packing | - |
dc.subject.keywordAuthor | heuristic | - |
dc.subject.keywordAuthor | linear programming | - |
dc.subject.keywordAuthor | mixed integer programming | - |
dc.subject.keywordAuthor | scheduling | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.