View in EDS

Mixed Integer Programming Formulations for Steiner Tree and Quality of Service Multicast Tree Problems.

Saved in:
Bibliographic Details
Title: Mixed Integer Programming Formulations for Steiner Tree and Quality of Service Multicast Tree Problems.
Authors: Risso, C.1 (AUTHOR) crisso@fing.edu.uy, Robledo, F.1 (AUTHOR) frobledo@fing.edu.uy, Nesmachnow, S.1 (AUTHOR) sergion@fing.edu.uy
Source: Programming & Computer Software. Dec2020, Vol. 46 Issue 8, p661-678. 18p.
Subjects: Multicasting (Computer networks), Integer programming, Quality of service, Content delivery networks, Telecommunication systems
Abstract: This article presents flow-based mixed integer programming formulations for the Steiner Tree Problem and its variant applied to model and solve the Quality of Service Multicast Tree problem. This is a relevant problem related to nowadays telecommunication networks, particularly Content Delivery Networks, to distribute multimedia over cloud-based Internet systems. To the best of our knowledge, no previous mixed integer programming formulation was proposed for the Quality of Service Multicast Tree problem variant. Experimental evaluation is performed over a set of realistic problem instances from SteinLib, a reference test-set repository, modified accordingly to prove that standard exact solvers are capable of finding solutions to real-world size instances. Exact methods are applied for benchmarking the proposed formulations, finding optimal solutions and low feasible-to-optimal gaps in reasonable execution times. [ABSTRACT FROM AUTHOR]
Copyright of Programming & Computer Software is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:This article presents flow-based mixed integer programming formulations for the Steiner Tree Problem and its variant applied to model and solve the Quality of Service Multicast Tree problem. This is a relevant problem related to nowadays telecommunication networks, particularly Content Delivery Networks, to distribute multimedia over cloud-based Internet systems. To the best of our knowledge, no previous mixed integer programming formulation was proposed for the Quality of Service Multicast Tree problem variant. Experimental evaluation is performed over a set of realistic problem instances from SteinLib, a reference test-set repository, modified accordingly to prove that standard exact solvers are capable of finding solutions to real-world size instances. Exact methods are applied for benchmarking the proposed formulations, finding optimal solutions and low feasible-to-optimal gaps in reasonable execution times. [ABSTRACT FROM AUTHOR]
ISSN:03617688
DOI:10.1134/S0361768820080174