TROUBIL, Pavel a Hana RUDOVÁ. Integer Linear Programming Models for Media Streams Planning. Lecture Notes in Management Science. Istanbul: Bahcesehir University, Istanbul, 2011, roč. 2011, č. 3, s. 509-522. ISSN 2008-0050. |
Další formáty:
BibTeX
LaTeX
RIS
@article{941666, author = {Troubil, Pavel and Rudová, Hana}, article_location = {Istanbul}, article_number = {3}, keywords = {media streams planning; integer programming; cycle avoidance}, language = {eng}, issn = {2008-0050}, journal = {Lecture Notes in Management Science}, title = {Integer Linear Programming Models for Media Streams Planning}, volume = {2011}, year = {2011} }
TY - JOUR ID - 941666 AU - Troubil, Pavel - Rudová, Hana PY - 2011 TI - Integer Linear Programming Models for Media Streams Planning JF - Lecture Notes in Management Science VL - 2011 IS - 3 SP - 509-522 EP - 509-522 PB - Bahcesehir University, Istanbul SN - 20080050 KW - media streams planning KW - integer programming KW - cycle avoidance N2 - 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. ER -
TROUBIL, Pavel a Hana RUDOVÁ. Integer Linear Programming Models for Media Streams Planning. \textit{Lecture Notes in Management Science}. Istanbul: Bahcesehir University, Istanbul, 2011, roč.~2011, č.~3, s.~509-522. ISSN~2008-0050.
|