Dynamic Reconfiguration in Multigroup Multicast Routing under Uncertainty
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F18%3A00100716" target="_blank" >RIV/00216224:14330/18:00100716 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s10732-017-9339-8" target="_blank" >http://dx.doi.org/10.1007/s10732-017-9339-8</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10732-017-9339-8" target="_blank" >10.1007/s10732-017-9339-8</a>
Alternative languages
Result language
angličtina
Original language name
Dynamic Reconfiguration in Multigroup Multicast Routing under Uncertainty
Original language description
Motivated by high quality multimedia and remote collaborative environments, we solve the problem of multigroup multicast routing with a~number of features important for real-world deployment of the interactive media technologies. Based on the ant colony optimization metaheuristic, our algorithm is the first to work with uncertain knowledge of underlying network capabilities and support on-the-fly media transcoding inside the multicast tree. New contributions of this work are described next. We present two extensions of the algorithm, which improve quality of the solution. We introduce an~integrated approach to solution of the problem, which is effective for both original solving from scratch as well as for new dynamic reconfiguration of multicast tree, where minimum perturbation of existing solution is desired. Experiments show that our algorithm is not only successful in maintaining existing communication with low number of unnecessary disruptions, but also capable of keeping the multicast trees efficient.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GAP202%2F12%2F0306" target="_blank" >GAP202/12/0306: Dyschnet - Dynamic planning and scheduling of computational and network resources</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Heuristics
ISSN
1381-1231
e-ISSN
—
Volume of the periodical
24
Issue of the periodical within the volume
3
Country of publishing house
CH - SWITZERLAND
Number of pages
29
Pages from-to
395-423
UT code for WoS article
000432802000008
EID of the result in the Scopus database
2-s2.0-85021799608