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

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 Netw...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Programming and computer software Ročník 46; číslo 8; s. 661 - 678
Hlavní autori: Risso, C., Robledo, F., Nesmachnow, S.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Moscow Pleiades Publishing 01.12.2020
Springer Nature B.V
Predmet:
Algorithms
Artificial Intelligence
Communications networks
Computer Science
Infrastructure
Integer programming
Internet
Mixed integer
Multicasting
Multimedia
Operating Systems
Quality of service
Software Engineering
Software Engineering/Programming and Operating Systems
ISSN:0361-7688, 1608-3261
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0361-7688
1608-3261
DOI:10.1134/S0361768820080174