Dynamic Reconfiguration in Multigroup Multicast Routing under
Uncertainty

J 2018

Dynamic Reconfiguration in Multigroup Multicast Routing under Uncertainty

TROUBIL, Pavel, Hana RUDOVÁ and Petr HOLUB

Basic information

Original name

Dynamic Reconfiguration in Multigroup Multicast Routing under Uncertainty

Authors

TROUBIL, Pavel (203 Czech Republic, belonging to the institution), Hana RUDOVÁ (203 Czech Republic, guarantor, belonging to the institution) and Petr HOLUB (203 Czech Republic, belonging to the institution)

Edition

Journal of Heuristics, Springer, 2018, 1381-1231

Other information

Language

English

Type of outcome

Článek v odborném periodiku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Switzerland

Confidentiality degree

není předmětem státního či obchodního tajemství

References:

DOI

Impact factor

Impact factor: 1.392

RIV identification code

RIV/00216224:14330/18:00100716

Organization unit

Faculty of Informatics

DOI

http://dx.doi.org/10.1007/s10732-017-9339-8

UT WoS

000432802000008

Keywords in English

networks; multicast routing; multimedia; uncertainty; online optimization

Abstract

V originále

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.

Links

GAP202/12/0306, research and development project

Name: Dyschnet - Dynamické plánování a rozvrhování výpočetních a síťových zdrojů (Acronym: Dyschnet)

Investor: Czech Science Foundation

Citovat

TROUBIL, Pavel, Hana RUDOVÁ and Petr HOLUB. Dynamic Reconfiguration in Multigroup Multicast Routing under Uncertainty. Journal of Heuristics. Springer, 2018, vol. 24, No 3, p. 395-423. ISSN 1381-1231. Available from: https://dx.doi.org/10.1007/s10732-017-9339-8.

@article{1388266,
   author = {Troubil, Pavel and Rudová, Hana and Holub, Petr},
   article_number = {3},
   doi = {http://dx.doi.org/10.1007/s10732-017-9339-8},
   keywords = {networks; multicast routing; multimedia; uncertainty; online optimization},
   language = {eng},
   issn = {1381-1231},
   journal = {Journal of Heuristics},
   title = {Dynamic Reconfiguration in Multigroup Multicast Routing under Uncertainty},
   url = {http://dx.doi.org/10.1007/s10732-017-9339-8},
   volume = {24},
   year = {2018}
}

TY  - JOUR
ID  - 1388266
AU  - Troubil, Pavel - Rudová, Hana - Holub, Petr
PY  - 2018
TI  - Dynamic Reconfiguration in Multigroup Multicast Routing under Uncertainty
JF  - Journal of Heuristics
VL  - 24
IS  - 3
SP  - 395-423
EP  - 395-423
PB  - Springer
SN  - 13811231
KW  - networks
KW  - multicast routing
KW  - multimedia
KW  - uncertainty
KW  - online optimization
UR  - http://dx.doi.org/10.1007/s10732-017-9339-8
L2  - http://dx.doi.org/10.1007/s10732-017-9339-8
N2  - 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.
ER  -

TROUBIL, Pavel, Hana RUDOVÁ and Petr HOLUB. Dynamic Reconfiguration in Multigroup Multicast Routing under Uncertainty. \textit{Journal of Heuristics}. Springer, 2018, vol.~24, No~3, p.~395-423. ISSN~1381-1231. Available from: https://dx.doi.org/10.1007/s10732-017-9339-8.

Detailed Information on Publication Record