z-logo
open-access-imgOpen Access
Solving the Quality of Service Multicast Tree Problem
Author(s) -
Claudio Enrique Risso-Montaldo,
Franco Rafael Robledo-Amoza,
Sergio Nesmachnow
Publication year - 2021
Publication title -
trudy instituta sistemnogo programmirovaniâ ran/trudy instituta sistemnogo programmirovaniâ
Language(s) - English
Resource type - Journals
eISSN - 2220-6426
pISSN - 2079-8156
DOI - 10.15514/ispras-2021-33(2)-10
Subject(s) - multicast , computer science , integer programming , tree (set theory) , benchmarking , quality of service , set (abstract data type) , cloud computing , service (business) , xcast , distributed computing , mathematical optimization , the internet , computer network , algorithm , mathematics , world wide web , mathematical analysis , economy , marketing , economics , business , programming language , operating system
This article presents a flow-based mixed integer programming formulation for the Quality of Service Multicast Tree problem. This is a relevant problem related to nowadays telecommunication networksto distribute multimedia over cloud-based Internet systems. To the best of our knowledge, no previous mixed integer programming formulation was proposed for Quality of Service Multicast Tree Problem. Experimental evaluation is performed over a set of realistic problem instances from SteinLib, to prove that standard exact solvers can find solutions to real-world size instances. Exact method is applied for benchmarking the proposed formulations, finding optimal solutions and low feasible-to-optimal gaps in reasonable execution times.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here