Integer Linear Programming Models and Cycle Avoidance Methods for Media Streams Planning
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F11%3A00052464" target="_blank" >RIV/00216224:14330/11:00052464 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Integer Linear Programming Models and Cycle Avoidance Methods for Media Streams Planning
Original language description
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 Problemis 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.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů