Detailed Information on Publication Record
2011
Integer Linear Programming Models for Media Streams Planning
TROUBIL, Pavel and Hana RUDOVÁBasic information
Original name
Integer Linear Programming Models for Media Streams Planning
Authors
TROUBIL, Pavel (203 Czech Republic, guarantor, belonging to the institution) and Hana RUDOVÁ (203 Czech Republic, belonging to the institution)
Edition
Lecture Notes in Management Science, Istanbul, Bahcesehir University, Istanbul, 2011, 2008-0050
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
Turkey
Confidentiality degree
není předmětem státního či obchodního tajemství
RIV identification code
RIV/00216224:14330/11:00052463
Organization unit
Faculty of Informatics
Keywords in English
media streams planning; integer programming; cycle avoidance
Tags
Tags
International impact, Reviewed
Změněno: 13/6/2013 12:33, RNDr. Pavel Troubil, Ph.D.
V originále
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.
In Czech
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.
Links
| MSM0021622419, plan (intention) |
| ||
| MUNI/A/0914/2009, interní kód MU |
|