Dynamic Reconfiguration in Multigroup Multicast Routing under Uncertainty

Kód výsledku v 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>

Výsledek na webu

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

Jazyk výsledku

angličtina

Název v původním jazyce

Dynamic Reconfiguration in Multigroup Multicast Routing under Uncertainty

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Dynamic Reconfiguration in Multigroup Multicast Routing under Uncertainty

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GAP202%2F12%2F0306" target="_blank" >GAP202/12/0306: Dyschnet - Dynamické plánování a rozvrhování výpočetních a síťových zdrojů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2018

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Journal of Heuristics

ISSN

1381-1231

e-ISSN

—

Svazek periodika

24

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

CH - Švýcarská konfederace

Počet stran výsledku

29

Strana od-do

395-423

Kód UT WoS článku

000432802000008

EID výsledku v databázi Scopus

2-s2.0-85021799608