Integer Linear Programming Models for Media Streams Planning

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F11%3A00052463" target="_blank" >RIV/00216224:14330/11:00052463 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Integer Linear Programming Models for Media Streams Planning
Original language description
Advanced collaborative environments frequently need to transfer highly demanding multimedia data streams with minimum possible latency. Since bandwidths of the streams are close to capacities of currently available links, routing of data transfers therefore requires planning with respect to link capacities and latency optimization. This paper describes integer linear programming techniques for optimal solution of the multimedia streams planning problem. Several methods for cycle avoidance in transmission graphs and network flows formulation are proposed. Performance of the methods was evaluated to identify their efficiency for real-time planning and to compare it against an earlier constraint programming approach applied in an application middleware called CoUniverse. According to the results, network flows formulation appears to be the most promising.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

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

Similar results(10)