2011
Integer Linear Programming Models and Cycle Avoidance Methods for Media Streams Planning
TROUBIL, Pavel a Hana RUDOVÁZákladní údaje
Originální název
Integer Linear Programming Models and Cycle Avoidance Methods for Media Streams Planning
Autoři
TROUBIL, Pavel (203 Česká republika, garant, domácí) a Hana RUDOVÁ (203 Česká republika, domácí)
Vydání
International Network Optimization Conference 2011, 2011
Další údaje
Jazyk
angličtina
Typ výsledku
Prezentace na konferencích
Obor
10201 Computer sciences, information science, bioinformatics
Stát vydavatele
Německo
Utajení
není předmětem státního či obchodního tajemství
Kód RIV
RIV/00216224:14330/11:00052464
Organizační jednotka
Fakulta informatiky
Klíčová slova anglicky
media streams planning; integer programming; cycle avoidance
Příznaky
Mezinárodní význam
Změněno: 13. 6. 2013 12:34, RNDr. Pavel Troubil, Ph.D.
Anotace
V originále
High-end collaborative tools simultaneously transmit multiple multimedia streams, each in an 1:n scheme. Bandwidth required by the streams is close to capacities of current links, and collaboration requires low latency. The Media Streams Planning Problem is a problem of routing streams in these tools. For each data source, a distribution tree is placed in the network. We optimize overall latency of all streams. Due to requests for quick call establishment, solver of the MSPP has to respond within seconds. Our aim is to improve its performance. We linearized the original CP formulation of the problem and proposed binary ILP solver to improve performance. We noticed that negative influence comes from cycle avoidance constraints. We proposed strategies which solve the problem without cycle avoidance methods, and eliminate only cycles appearing in the solutions. We also combined binary formulation with network flows constraints. This method avoids cycles and improves performance.
Návaznosti
| MSM0021622419, záměr |
| ||
| MUNI/A/0914/2009, interní kód MU |
|